WorldWideScience

Sample records for asymptotic iteration method

  1. Exact Solution of Klein-Gordon Equation by Asymptotic Iteration Method

    Institute of Scientific and Technical Information of China (English)

    Eser Ol(g)ar

    2008-01-01

    Using the asymptotic iteration method (AIM) we obtain the spectrum of the Klein-Gordon equation for some choices of scalar and vector potentials. In particular, it is shown that the AIM exactly reproduces the spectrum of some solvable potentials.

  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. Comment on an application of the asymptotic iteration method to a perturbed Coulomb model

    Energy Technology Data Exchange (ETDEWEB)

    Amore, Paolo [Facultad de Ciencias, Universidad de Colima, Bernal DIaz del Castillo 340, Colima (Mexico); Fernandez, Francisco M [INIFTA (Conicet, UNLP), Blvd. 113 y 64 S/N, Sucursal 4, Casilla de Correo 16, 1900 La Plata (Argentina)

    2006-08-18

    We discuss a recent application of the asymptotic iteration method (AIM) to a perturbed Coulomb model. Contrary to what was argued before we show that the AIM converges and yields accurate energies for that model. We also consider alternative perturbation approaches and show that one of them is equivalent to that recently proposed by another author.

  4. Asymptotic iteration approach to supersymmetric bistable potentials

    Institute of Scientific and Technical Information of China (English)

    H. Ciftci; O. ozer; P. Roy

    2012-01-01

    We examine quasi exactly solvable bistable potentials and their supersymmetric partners within the framework of the asymptotic iteration method (AIM).It is shown that the AIM produces excellent approximate spectra and that sometimes it is found to be more useful to use the partner potential for computation. We also discuss the direct application of the AIM to the Fokker-Planck equation.

  5. Asymptotic iteration method for the modified Pöschl-Teller potential and trigonometric Scarf II non-central potential in the Dirac equation spin symmetry

    Science.gov (United States)

    Pratiwi, Beta Nur; Suparmi, A.; Cari, C.; Husein, Andri Sofyan

    2017-02-01

    Analytical solution of the Dirac equation for the modified Pöschl-Teller potential and trigonometric Scarf II non-central potential for spin symmetry is studied using asymptotic iteration method. One-dimensional Dirac equation consisting of the radial and angular parts can be obtained by the separation of variables. By using asymptotic iteration method, the relativistic energy equation and orbital quantum number ( l) equation can be obtained, where both are interrelated. Relativistic energy equation is calculated numerically by the Matlab software. The increase in the radial quantum number n r 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 can be determined by reducing the relativistic energy equation to the non-relativistic energy equation. Thermodynamical properties such as vibrational partition function, vibrational specific heat function and vibrational mean energy function are expressed in terms of error function.

  6. Asymptotic iteration method for the modified Pöschl–Teller potential and trigonometric Scarf II non-central potential in the Dirac equation spin symmetry

    Indian Academy of Sciences (India)

    BETA NUR PRATIWI; A SUPARMI; C CARI; ANDRI SOFYAN HUSEIN

    2017-02-01

    Analytical solution of the Dirac equation for the modified Pöschl–Teller potential and trigonometric Scarf II non-central potential for spin symmetry is studied using asymptotic iteration method. One-dimensional Dirac equation consisting of the radial and angular parts can be obtained by the separation of variables. By usingasymptotic iteration method, the relativistic energy equation and orbital quantum number (l) equation can be obtained, where both are interrelated. Relativistic energy equation is calculated numerically by the Matlab software. The increase in the radial quantum number $n_r$ 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 can be determined by reducing the relativistic energy equation to the non-relativisticenergy equation. Thermodynamical properties such as vibrational partition function, vibrational specific heat function and vibrational mean energy function are expressed in terms of error function.

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

  8. Relativistic Energy Analysis Of Five Dimensional q-Deformed Radial Rosen-Morse Potential Combined With q-Deformed Trigonometric Scarf Non-Central Potential Using Asymptotic Iteration Method (AIM)

    CERN Document Server

    Pramono, Subur; Cari, Cari

    2016-01-01

    In this work, we study the exact solution of Dirac equation in the hyper-spherical coordinate under influence of separable q-Deformed quantum potentials. The q-deformed hyperbolic Rosen-Morse potential is perturbed by q-deformed non-central trigonometric Scarf potentials, where whole 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 lD-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 Mat Lab, the increase of radial quantum number n causes the increase of bound state relativistic energy level both in dimension D = 5 and D = 3. The bound state relativistic energy level decreases with increasing of both deformation parameter q and orbital quantum number nl.

  9. Asymptotic Methods for Solitary Solutions and Compactons

    Directory of Open Access Journals (Sweden)

    Ji-Huan He

    2012-01-01

    Full Text Available This paper is an elementary introduction to some new asymptotic methods for the search for the solitary solutions of nonlinear differential equations, nonlinear differential-difference equations, and nonlinear fractional differential equations. Particular attention is paid throughout the paper to giving an intuitive grasp for the variational approach, the Hamiltonian approach, the variational iteration method, the homotopy perturbation method, the parameter-expansion method, the Yang-Laplace transform, the Yang-Fourier transform, and ancient Chinese mathematics. Hamilton principle and variational principles are also emphasized. The reviewed asymptotic methods are easy to be followed for various applications. Some ideas on this paper are first appeared.

  10. A FAST CONVERGENT METHOD OF ITERATED REGULARIZATION

    Institute of Scientific and Technical Information of China (English)

    Huang Xiaowei; Wu Chuansheng; Wu Di

    2009-01-01

    This article presents a fast convergent method of iterated regularization based on the idea of Landweber iterated regularization, and a method for a-posteriori choice by the Morozov discrepancy principle and the optimum asymptotic convergence order of the regularized solution is obtained. Numerical test shows that the method of iterated regu-larization can quicken the convergence speed and reduce the calculation burden efficiently.

  11. Applied iterative methods

    CERN Document Server

    Hageman, Louis A

    2004-01-01

    This graduate-level text examines the practical use of iterative methods in solving large, sparse systems of linear algebraic equations and in resolving multidimensional boundary-value problems. Assuming minimal mathematical background, it profiles the relative merits of several general iterative procedures. Topics include polynomial acceleration of basic iterative methods, Chebyshev and conjugate gradient acceleration procedures applicable to partitioning the linear system into a "red/black" block form, adaptive computational algorithms for the successive overrelaxation (SOR) method, and comp

  12. The optimal homotopy asymptotic method engineering applications

    CERN Document Server

    Marinca, Vasile

    2015-01-01

    This book emphasizes in detail the applicability of the Optimal Homotopy Asymptotic Method to various engineering problems. It is a continuation of the book “Nonlinear Dynamical Systems in Engineering: Some Approximate Approaches”, published at Springer in 2011, and it contains a great amount of practical models from various fields of engineering such as classical and fluid mechanics, thermodynamics, nonlinear oscillations, electrical machines, and so on. The main structure of the book consists of 5 chapters. The first chapter is introductory while the second chapter is devoted to a short history of the development of homotopy methods, including the basic ideas of the Optimal Homotopy Asymptotic Method. The last three chapters, from Chapter 3 to Chapter 5, are introducing three distinct alternatives of the Optimal Homotopy Asymptotic Method with illustrative applications to nonlinear dynamical systems. The third chapter deals with the first alternative of our approach with two iterations. Five application...

  13. On the Convergence of Iterative Processes for Generalized Strongly Asymptotically -Pseudocontractive Mappings in Banach Spaces

    Directory of Open Access Journals (Sweden)

    Vittorio Colao

    2012-01-01

    Full Text Available We prove the equivalence and the strong convergence of iterative processes involving generalized strongly asymptotically -pseudocontractive mappings in uniformly smooth Banach spaces.

  14. Robust iterative methods

    Energy Technology Data Exchange (ETDEWEB)

    Saadd, Y.

    1994-12-31

    In spite of the tremendous progress achieved in recent years in the general area of iterative solution techniques, there are still a few obstacles to the acceptance of iterative methods in a number of applications. These applications give rise to very indefinite or highly ill-conditioned non Hermitian matrices. Trying to solve these systems with the simple-minded standard preconditioned Krylov subspace methods can be a frustrating experience. With the mathematical and physical models becoming more sophisticated, the typical linear systems which we encounter today are far more difficult to solve than those of just a few years ago. This trend is likely to accentuate. This workshop will discuss (1) these applications and the types of problems that they give rise to; and (2) recent progress in solving these problems with iterative methods. The workshop will end with a hopefully stimulating panel discussion with the speakers.

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

    Science.gov (United States)

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

    2016-08-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 nr 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.

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

  17. ITERATIVE APPROXIMATION OF FIXED POINTS OF NON-LIPSCHITZIAN ASYMPTOTICALLY PSEUDOCONTRACTIVE MAPPINGS

    Institute of Scientific and Technical Information of China (English)

    曾六川

    2003-01-01

    The purpose of this paper is to investigate the problem of approximatingfixed points of non- Lipschitizian asymptotically pseudocontractive mappings in an ar-bitrary real Banach space by the modified Ishikawa iterative sequences with errors.

  18. New iterative schemes for asymptotically quasi-nonexpansive nonself-mappings in Banach spaces

    Science.gov (United States)

    Wang, Chao; Zhu, Jinghao; An, Lili

    2010-04-01

    In this paper, a new two-step iterative scheme with errors is introduced for two asymptotically quasi-nonexpansive nonself-mappings. Several convergence theorems are established in real Banach spaces and real uniformly convex Banach spaces. Our theorems improve and extend the results due to Thianwan [S. Thianwan, Common fixed point of new iterations for two asymptotically nonexpansive nonself-mappings in a Banach space, J. Comput. Appl. Math. 224 (2009) 685-695] and many other papers.

  19. Implicit predictor-corrector iteration process for finitely many asymptotically (quasi-nonexpansive mappings

    Directory of Open Access Journals (Sweden)

    Wong NC

    2006-01-01

    Full Text Available We study an implicit predictor-corrector iteration process for finitely many asymptotically quasi-nonexpansive self-mappings on a nonempty closed convex subset of a Banach space . We derive a necessary and sufficient condition for the strong convergence of this iteration process to a common fixed point of these mappings. In the case is a uniformly convex Banach space and the mappings are asymptotically nonexpansive, we verify the weak (resp., strong convergence of this iteration process to a common fixed point of these mappings if Opial's condition is satisfied (resp., one of these mappings is semicompact. Our results improve and extend earlier and recent ones in the literature.

  20. Some geometrical iteration methods for nonlinear equations

    Institute of Scientific and Technical Information of China (English)

    LU Xing-jiang; QIAN Chun

    2008-01-01

    This paper describes geometrical essentials of some iteration methods (e.g. Newton iteration,secant line method,etc.) for solving nonlinear equations and advances some geomet-rical methods of iteration that are flexible and efficient.

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

  2. A Linear Iterative Unfolding Method

    CERN Document Server

    Laszlo, Andras

    2011-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 numerical ill-posedness of this task, various methods were invented which, given some assumptions on the initial probability distribution, try to regularize the problem. Most of these methods definitely introduce bias on 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. Convergence is proved under certain quite general conditions, which hold for p...

  3. A Novel Iterative Algorithm Applied to Totally Asymptotically Nonexpansive Mappings in CAT(0 Spaces

    Directory of Open Access Journals (Sweden)

    Ali Abkar

    2017-02-01

    Full Text Available In this paper we introduce a new iterative algorithm for approximating fixed points of totally asymptotically quasi-nonexpansive mappings on CAT(0 spaces. We prove a strong convergence theorem under suitable conditions. The result we obtain improves and extends several recent results stated by many others; they also complement many known recent results in the literature. We then provide some numerical examples to illustrate our main result and to display the efficiency of the proposed algorithm.

  4. Iterative method for interferogram processing

    Science.gov (United States)

    Kotlyar, Victor V.; Seraphimovich, P. G.; Zalyalov, Oleg K.

    1994-12-01

    We have developed and numerically evaluated an iterative algorithm for interferogram processing including the Fourier-transform method, the Gerchberg-Papoulis algorithm and Wiener's filter-based regularization used in combination. Using a signal-to-noise ratio not less than 1, it has been possible to reconstruct the phase of an object field with accuracy better than 5%.

  5. Optimal Variational Asymptotic Method for Nonlinear Fractional Partial Differential Equations.

    Science.gov (United States)

    Baranwal, Vipul K; Pandey, Ram K; Singh, Om P

    2014-01-01

    We propose optimal variational asymptotic method to solve time fractional nonlinear partial differential equations. In the proposed method, an arbitrary number of auxiliary parameters γ 0, γ 1, γ 2,… and auxiliary functions H 0(x), H 1(x), H 2(x),… are introduced in the correction functional of the standard variational iteration method. The optimal values of these parameters are obtained by minimizing the square residual error. To test the method, we apply it to solve two important classes of nonlinear partial differential equations: (1) the fractional advection-diffusion equation with nonlinear source term and (2) the fractional Swift-Hohenberg equation. Only few iterations are required to achieve fairly accurate solutions of both the first and second problems.

  6. A Berry-Esseen Theorem and a Law of the Iterated Logarithm for Asymptotically Negatively Associated Sequences

    Institute of Scientific and Technical Information of China (English)

    Jian Feng WANG; Li Xin ZHANG

    2007-01-01

    Negatively associated sequences have been studied extensively in recent years. Asymp-totically negative association is a generalization of negative association. In this paper a Berry-Esseen theorem and a law of the iterated logarithm are obtained for asymptotically negatively associated sequences.

  7. An Iterative Rejection Sampling Method

    CERN Document Server

    Sherstnev, A

    2008-01-01

    In the note we consider an iterative generalisation of the rejection sampling method. In high energy physics, this sampling is frequently used for event generation, i.e. preparation of phase space points distributed according to a matrix element squared $|M|^2$ for a scattering process. In many realistic cases $|M|^2$ is a complicated multi-dimensional function, so, the standard von Neumann procedure has quite low efficiency, even if an error reducing technique, like VEGAS, is applied. As a result of that, many of the $|M|^2$ calculations go to ``waste''. The considered iterative modification of the procedure can extract more ``unweighted'' events, i.e. distributed according to $|M|^2$. In several simple examples we show practical benefits of the technique and obtain more events than the standard von Neumann method, without any extra calculations of $|M|^2$.

  8. Common fixed points of new iterations for two asymptotically nonexpansive nonself-mappings in a Banach space

    Science.gov (United States)

    Thianwan, Sornsak

    2009-02-01

    In this paper, we introduce a new two-step iterative scheme for two asymptotically nonexpansive nonself-mappings in a uniformly convex Banach space. Weak and strong convergence theorems are established for the new two-step iterative scheme in a uniformly convex Banach space.

  9. Convergence Theorems on a New Iteration Process for Two Asymptotically Nonexpansive Nonself-Mappings with Errors in Banach Spaces

    Directory of Open Access Journals (Sweden)

    Murat Ozdemir

    2010-01-01

    Full Text Available We introduce a new two-step iterative scheme for two asymptotically nonexpansive nonself-mappings in a uniformly convex Banach space. Weak and strong convergence theorems are established for this iterative scheme in a uniformly convex Banach space. The results presented extend and improve the corresponding results of Chidume et al. (2003, Wang (2006, Shahzad (2005, and Thianwan (2008.

  10. Iterative methods for mixed finite element equations

    Science.gov (United States)

    Nakazawa, S.; Nagtegaal, J. C.; Zienkiewicz, O. C.

    1985-01-01

    Iterative strategies for the solution of indefinite system of equations arising from the mixed finite element method are investigated in this paper with application to linear and nonlinear problems in solid and structural mechanics. The augmented Hu-Washizu form is derived, which is then utilized to construct a family of iterative algorithms using the displacement method as the preconditioner. Two types of iterative algorithms are implemented. Those are: constant metric iterations which does not involve the update of preconditioner; variable metric iterations, in which the inverse of the preconditioning matrix is updated. A series of numerical experiments is conducted to evaluate the numerical performance with application to linear and nonlinear model problems.

  11. Approximating common fixed points of asymptotically quasi-nonexpansive mappings by a k+1-step iterative scheme with error terms

    Science.gov (United States)

    Xiao, Jian-Zhong; Sun, Jing; Huang, Xuan

    2010-02-01

    In this paper a k+1-step iterative scheme with error terms involving k+1 asymptotically quasi-nonexpansive mappings is studied. In usual Banach spaces, some sufficient and necessary conditions are given for the iterative scheme to approximate a common fixed point. In uniformly convex Banach spaces, power equicontinuity for a mapping is introduced and a series of new convergence theorems are established. Several known results in the current literature are extended and refined.

  12. Viscosity Approximation Method for Infinitely Many Asymptotically Nonexpansive Maps in Banach Spaces

    Institute of Scientific and Technical Information of China (English)

    Ruo Feng RAO

    2011-01-01

    In the framework of reflexive Banach spaces satisfying a weakly continuous duality map,the author uses the viscosity approximation method to obtain the strong convergence theorem for iterations with infinitely many asymptotically nonexpansive mappings.The main results obtained in this paper improve and extend some recent results.

  13. Viscosity Methods of Asymptotically Pseudocontractive and Asymptotically Nonexpansive Mappings for Variational Inequalities

    Directory of Open Access Journals (Sweden)

    Xionghua Wu

    2012-01-01

    Full Text Available Let {}⊂(0,1 be such that →1 as →∞, let and be two positive numbers such that +=1, and let be a contraction. If be a continuous asymptotically pseudocontractive self-mapping of a nonempty bounded closed convex subset of a real reflexive Banach space with a uniformly Gateaux differentiable norm, under suitable conditions on the sequence {}, we show the existence of a sequence {} satisfying the relation =(1−/(+(/ and prove that {} converges strongly to the fixed point of , which solves some variational inequality provided is uniformly asymptotically regular. As an application, if be an asymptotically nonexpansive self-mapping of a nonempty bounded closed convex subset of a real Banach space with a uniformly Gateaux differentiable norm and which possesses uniform normal structure, we prove that the iterative process defined by 0∈,+1=(1−/(+(/+(/ converges strongly to the fixed point of .

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

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

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

  17. An iterative method for spherical bounces

    CERN Document Server

    Buniy, Roman V

    2016-01-01

    We develop a new iterative method for finding approximate solutions for spherical bounces associated with the decay of the false vacuum in scalar field theories. The method works for any generic potential in any number of dimensions, contains Coleman's thin-wall approximation as its first iteration, and greatly improves its accuracy by including higher order terms.

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

  19. Modeling of nanoplastic by asymptotic homogenization method

    Institute of Scientific and Technical Information of China (English)

    张为民; 何伟; 李亚; 张平; 张淳源

    2008-01-01

    The so-called nanoplastic is a new simple name for the polymer/layered silicate nanocomposite,which possesses excellent properties.The asymptotic homogenization method(AHM) was applied to determine numerically the effective elastic modulus of a two-phase nanoplastic with different particle aspect ratios,different ratios of elastic modulus of the effective particle to that of the matrix and different volume fractions.A simple representative volume element was proposed,which is assumed that the effective particles are uniform well-aligned and perfectly bonded in an isotropic matrix and have periodic structure.Some different theoretical models and the experimental results were compared.The numerical results are good in agreement with the experimental results.

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

  1. The Optimal Homotopy Asymptotic Method for the Solution of Higher-Order Boundary Value Problems in Finite Domains

    Directory of Open Access Journals (Sweden)

    Javed Ali

    2012-01-01

    Full Text Available We solve some higher-order boundary value problems by the optimal homotopy asymptotic method (OHAM. The proposed method is capable to handle a wide variety of linear and nonlinear problems effectively. The numerical results given by OHAM are compared with the exact solutions and the solutions obtained by Adomian decomposition (ADM, variational iteration (VIM, homotopy perturbation (HPM, and variational iteration decomposition method (VIDM. The results show that the proposed method is more effective and reliable.

  2. Approximation common fixed point of asymptotically quasi-nonexpansive-type mappings by the finite steps iterative sequences

    Directory of Open Access Journals (Sweden)

    Chang Shih-Sen

    2006-01-01

    Full Text Available The purpose of this paper is to study sufficient and necessary conditions for finite-step iterative sequences with mean errors for a finite family of asymptotically quasi-nonexpansive and type mappings in Banach spaces to converge to a common fixed point. The results presented in this paper improve and extend the recent ones announced by Ghost-Debnath, Liu, Xu and Noor, Chang, Shahzad et al., Shahzad and Udomene, Chidume et al., and all the others.

  3. An Implicit Iteration Process with Errors for a Finite Family of r-strictly Asymptotically Pseudocontractive Mappings

    Institute of Scientific and Technical Information of China (English)

    Liang-gen Hu

    2007-01-01

    In this paper,we will establish several strong convergence theorems for thc approximation of common fixed points of γ-strictly asymptotically pseudocontractive mappings in uniformly convex Banach spaces using the modiied implicit iteration sequence with errors,and prove the necessary and sufficient conditions for the convergence of the sequence.Our results generalize,extend and improve the recent work,in this topic[9,10].

  4. Variational iteration method for solving the mechanism of the Equatorial Eastern Pacific El Ni(n)o-Southern Oscillation

    Institute of Scientific and Technical Information of China (English)

    Mo Jia-Qi; Wang Hui; Lin Wan-Tao; Lin Yi-Hua

    2006-01-01

    A class of coupled system for the El Ni(n)o-Southern Oscillation(ENSO)mechanism is studied.Using the method of variational iteration for perturbation theory,the asymptotic expansions of the solution for ENSO model are obtained and the asymptotic behaviour of solution for corresponding problem is considered.

  5. Asymptotic-induced numerical methods for conservation laws

    Science.gov (United States)

    Garbey, Marc; Scroggs, Jeffrey S.

    1990-01-01

    Asymptotic-induced methods are presented for the numerical solution of hyperbolic conservation laws with or without viscosity. The methods consist of multiple stages. The first stage is to obtain a first approximation by using a first-order method, such as the Godunov scheme. Subsequent stages of the method involve solving internal-layer problems identified by using techniques derived via asymptotics. Finally, a residual correction increases the accuracy of the scheme. The method is derived and justified with singular perturbation techniques.

  6. Newton—Like Iteration Method for Solving Algebraic Equations

    Institute of Scientific and Technical Information of China (English)

    JihuanHE

    1998-01-01

    In this paper,a Newton-like iteration method is proposed to solve an approximate solution of an algebraic equation.The iteration formula obtained by homotopy perturbation method contains the well-known Newton iteration formulain logic.

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

  8. The New Ishikawa Iteration Approximation with Errors for Asymptotically φ-Hemicontractive Mapping%渐近φ半压缩映象新的带误差的IshiKawa迭代逼近

    Institute of Scientific and Technical Information of China (English)

    杨理平

    2004-01-01

    Let E be a real Banach space and T be an asymptotically φ-hemicontractive mapping. By properties of a new analytical method, under general cases, the strong convergence of the set sequences {On} of the new Ishikawa iteration approximation with errors to the fixed point of mapping is proved. The paper generalizes and improves the corresponding results in {1},[3-8].

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

  10. ASYMPTOTIC BEHAVIOR OF ECKHOFF'S METHOD FOR FOURIER SERIES CONVERGENCE ACCELERATION

    Institute of Scientific and Technical Information of China (English)

    2007-01-01

    The current paper considers the problem of recovering a function using a limited number of its Fourier coefficients. Specifically, a method based on Bernoulli-like polynomials suggested and developed by Krylov, Lanczos, Gottlieb and Eckhoff is examined.Asymptotic behavior of approximate calculation of the so-called "jumps" is studied and asymptotic L2 constants of the rate of convergence of the method are computed.

  11. An Elementary Introduction to Recently Developed Asymptotic Methods and Nanomechanics in Textile Engineering

    Science.gov (United States)

    He, Ji-Huan

    This review is an elementary introduction to the concepts of the recently developed asymptotic methods and new developments. Particular attention is paid throughout the paper to giving an intuitive grasp for Lagrange multiplier, calculus of variations, optimization, variational iteration method, parameter-expansion method, exp-function method, homotopy perturbation method, and ancient Chinese mathematics as well. Subsequently, nanomechanics in textile engineering and E-infinity theory in high energy physics, Kleiber's 3/4 law in biology, possible mechanism in spider-spinning process and fractal approach to carbon nanotube are briefly introduced. Bubble-electrospinning for mass production of nanofibers is illustrated. There are in total more than 280 references.

  12. An Adaptive Iterated Nonlocal Interferometry Filtering Method

    Directory of Open Access Journals (Sweden)

    Lin Xue

    2014-04-01

    Full Text Available Interferometry filtering is one of the key steps in obtain high-precision Digital Elevation Model (DEM and Digital Orthophoto Map (DOM. In the case of low-correlation or complicated topography, traditional phase filtering methods fail in balancing noise elimination and phase preservation, which leads to inaccurate interferometric phase. This paper proposed an adaptive iterated nonlocal interferometry filtering method to deal with the problem. Based on the thought of nonlocal filtering, the proposed method filters the image with utilization of the image redundancy information. The smoothing parameter of the method is adaptive to the interferometry, and automatic iteration, in which the window size is adjusted, is applied to improve the filtering precision. Validity of the proposed method is verified by simulated and real data. Comparison with existed methods is given at the same time.

  13. Iterative Brinkman penalization for remeshed vortex methods

    Science.gov (United States)

    Hejlesen, Mads Mølholm; Koumoutsakos, Petros; Leonard, Anthony; Walther, Jens Honoré

    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 steps, than what is customary in the Brinkman penalization, thus reducing its computational cost while maintaining the capability of the method to handle complex geometries. We demonstrate the accuracy of our method by considering challenging benchmark problems such as flow past an impulsively started cylinder and normal to an impulsively started and accelerated flat plate. We find that the present method enhances significantly the accuracy of the Brinkman penalization technique for the simulations of highly unsteady flows past complex geometries.

  14. Aggregation-iterative analogues and generalizations of projection-iterative methods

    Directory of Open Access Journals (Sweden)

    Shuvar B.F.

    2013-06-01

    Full Text Available Aggregation-iterative algorithms for linear operator equations are constructed and investigated. These algorithms cover methods of iterative aggregation and projection-iterative methods. In convergence conditions there is neither requirement for the corresponding operator of fixed sign no restriction to the spectral radius to be less than one.

  15. The Iterative Method of Generalized -Concave Operators

    Directory of Open Access Journals (Sweden)

    Zhou Yanqiu

    2011-01-01

    Full Text Available We define the concept of the generalized -concave operators, which generalize the definition of the -concave operators. By using the iterative method and the partial ordering method, we prove the existence and uniqueness of fixed points of this class of the operators. As an example of the application of our results, we show the existence and uniqueness of solutions to a class of the Hammerstein integral equations.

  16. Iterative Regularization with Minimum-Residual Methods

    DEFF Research Database (Denmark)

    Jensen, Toke Koldborg; Hansen, Per Christian

    2007-01-01

    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...... 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...... as regularization methods is highly problem dependent....

  17. Iterative regularization with minimum-residual methods

    DEFF Research Database (Denmark)

    Jensen, Toke Koldborg; Hansen, Per Christian

    2006-01-01

    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...... 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...... as regularization methods is highly problem dependent....

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

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

  20. Modified Hybrid Block Iterative Algorithm for Uniformly Quasi--Asymptotically Nonexpansive Mappings

    Directory of Open Access Journals (Sweden)

    Qiansheng Feng

    2012-01-01

    Full Text Available Saewan and Kumam (2010 have proved the convergence theorems for finding the set of solutions of a general equilibrium problems and the common fixed point set of a family of closed and uniformly quasi--asymptotically nonexpansive mappings in a uniformly smooth and strictly convex Banach space E with Kadec-Klee property. In this paper, authors prove the convergence theorems and do not need the Kadec-Klee property of Banach space and some other conditions used in the paper of S. Saewan and P. Kumam. Therefore, the results presented in this paper improve and extend some recent results.

  1. A short remark on fractional variational iteration method

    Energy Technology Data Exchange (ETDEWEB)

    He, Ji-Huan, E-mail: hejihuan@suda.edu.cn [National Engineering Laboratory for Modern Silk, College of Textile and Engineering, Soochow University, 199 Ren-ai Road, Suzhou 215123 (China)

    2011-09-05

    This Letter compares the classical variational iteration method with the fractional variational iteration method. The fractional complex transform is introduced to convert a fractional differential equation to its differential partner, so that its variational iteration algorithm can be simply constructed. -- Highlights: → The variational iteration method and its fractional modification are compared. → The demerits arising are overcome by the fractional complex transform. → The Letter provides a powerful tool to solving fractional differential equations.

  2. Methods used for research regarding iteration in instructional design

    NARCIS (Netherlands)

    Verstegen, D.M.L.

    2004-01-01

    This paper focuses on the search for suitable research methods for research regarding iteration in instructional design. More specifically my research concerned the question how instructional designers can be supported during an iterative design process. Although instructional design and development

  3. A note on the paper: On iterations for families of asymptotically pseudocontractive mappings, Applied Mathematics Letters, 24 (2011), 33-38

    CERN Document Server

    Ofoedu, Eric U

    2010-01-01

    It is our aim in this note to give a counter example to an argument used in the proof of the main theorem of the paper: On iterations for families of asymptotically pseudocontractive mappings, Applied Mathematics Letters, 24 (2011), 33-38 by A. Rafiq; and give an alternative condition to correct the anomaly.

  4. Assessment of density functional methods with correct asymptotic behavior

    CERN Document Server

    Tsai, Chen-Wei; Li, Guan-De; Chai, Jeng-Da

    2012-01-01

    Long-range corrected (LC) hybrid functionals and asymptotically corrected (AC) model potentials are two distinct density functional methods with correct asymptotic behavior. They are known to be accurate for properties that are sensitive to the asymptote of the exchange-correlation potential, such as the highest occupied molecular orbital energies and Rydberg excitation energies of molecules. To provide a comprehensive comparison, we investigate the performance of the two schemes and others on a very wide range of applications, including the asymptote problems, self-interaction-error problems, energy-gap problems, charge-transfer problems, and many others. The LC hybrid scheme is shown to consistently outperform the AC model potential scheme. In addition, to be consistent with the molecules collected in the IP131 database [Y.-S. Lin, C.-W. Tsai, G.-D. Li, and J.-D. Chai, J. Chem. Phys. 136, 154109 (2012)], we expand the EA115 and FG115 databases to include, respectively, the vertical electron affinities and f...

  5. Viscosity-projection method for a family of general equilibrium problems and asymptotically strict pseudocontractions in the intermediate sense.

    Science.gov (United States)

    Wen, Dao-Jun

    2013-01-01

    In this paper, a Meir-Keeler contraction is introduced to propose a viscosity-projection approximation method for finding a common element of the set of solutions of a family of general equilibrium problems and the set of fixed points of asymptotically strict pseudocontractions in the intermediate sense. Strong convergence of the viscosity iterative sequences is obtained under some suitable conditions. Results presented in this paper extend and unify the previously known results announced by many other authors.

  6. Iterative methods for Toeplitz-like matrices

    Energy Technology Data Exchange (ETDEWEB)

    Huckle, T. [Universitaet Wurzburg (Germany)

    1994-12-31

    In this paper the author will give a survey on iterative methods for solving linear equations with Toeplitz matrices, Block Toeplitz matrices, Toeplitz plus Hankel matrices, and matrices with low displacement rank. He will treat the following subjects: (1) optimal (w)-circulant preconditioners is a generalization of circulant preconditioners; (2) Optimal implementation of circulant-like preconditioners in the complex and real case; (3) preconditioning of near-singular matrices; what kind of preconditioners can be used in this case; (4) circulant preconditioning for more general classes of Toeplitz matrices; what can be said about matrices with coefficients that are not l{sub 1}-sequences; (5) preconditioners for Toeplitz least squares problems, for block Toeplitz matrices, and for Toeplitz plus Hankel matrices.

  7. Asymptotic-Preserving methods and multiscale models for plasma physics

    CERN Document Server

    Degond, Pierre

    2016-01-01

    The purpose of the present paper is to provide an overview of Asymptotic-Preserving methods for multiscale plasma simulations by addressing three singular perturbation problems. First, the quasi-neutral limit of fluid and kinetic models is investigated in the framework of non magnetized as well as magnetized plasmas. Second, the drift limit for fluid descriptions of thermal plasmas under large magnetic fields is addressed. Finally efficient numerical resolutions of anisotropic elliptic or diffusion equations arising in magnetized plasma simulation are reviewed.

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

  9. An Efficient Bayesian Iterative Method for Solving Linear Systems

    Institute of Scientific and Technical Information of China (English)

    Deng DING; Kin Sio FONG; Ka Hou CHAN

    2012-01-01

    This paper concerns with the statistical methods for solving general linear systems.After a brief review of Bayesian perspective for inverse problems,a new and efficient iterative method for general linear systems from a Bayesian perspective is proposed.The convergence of this iterative method is proved,and the corresponding error analysis is studied.Finally,numerical experiments are given to support the efficiency of this iterative method,and some conclusions are obtained.

  10. Solving the Kuramoto-Sivashinsky equation via Variational Iteration Method

    Directory of Open Access Journals (Sweden)

    majeed Ahmed Yousif

    2014-06-01

    Full Text Available In this study, the approximate solutions for the Kuramoto-Sivashinsky equation by using the Variational Iteration Method (VIM are obtained. Comparisons with the exact solutions and the solutions obtained by the Homotopy Perturbation Method (HPM, the numerical example show that the Variational Iteration Method (VIM is accurate and effective and suitable for this kind of problem. Keywords: Kuramoto-Sivashinsky equation, Variational Iteration Method.

  11. Regularization and Iterative Methods for Monotone Variational Inequalities

    Directory of Open Access Journals (Sweden)

    Xiubin Xu

    2010-01-01

    Full Text Available We provide a general regularization method for monotone variational inequalities, where the regularizer is a Lipschitz continuous and strongly monotone operator. We also introduce an iterative method as discretization of the regularization method. We prove that both regularization and iterative methods converge in norm.

  12. Asymptotic stability properties of θ-methods for delay differential equations

    Institute of Scientific and Technical Information of China (English)

    2001-01-01

    Deals with the asymptotic stability properties of θ- methods for the pantograph equation and the linear delay differential-algebraic equation with emphasis on the linear θ- methods with variable stepsize schemes for the pantograph equation, proves that asymptotic stability is obtained if and only if θ > 1/2, and studies further the one-leg θ- method for the linear delay differential-algebraic equation and establishes the sufficient asymptotic-ally differential-algebraic stable condition θ = 1.

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

  14. (渐近)非扩张映象的不动点的迭代逼近%ITERATIVE APPROXIMATION OF FIXED POINTS OF (ASYMPTOTICALLY) NONEXPANSIVE MAPPINGS

    Institute of Scientific and Technical Information of China (English)

    2001-01-01

    Let E be a uniformly convex Banach space which satisfies Opial's condition or has a Frechet differentiable norm,and C be a bounded closed convex subset of E. If T∶C→C is (asymptotically)nonexpansive,then the modified Ishikawa iteration process defined byxn+1=tnTnsnTnxn+1-snxn+(1-tn)xn,converges weakly to a fixed point of T,where {tn} and {sn} are sequences in [0,1] with some restrictions.

  15. Convergence of Common Random Fixed Point of Finite Family of Asymptotically Quasi-Nonexpansive-Type Mappings by an Implicit Random Iterative Scheme

    Directory of Open Access Journals (Sweden)

    A. S. Saluja

    2013-01-01

    Full Text Available We introduce a new implicit random iteration process generated by a finite family of asymptotically quasi-nonexpansive-type mappings and study necessary and sufficient conditions for the convergence of this process in a uniformly convex Banach space. The results presented in this paper extend and improve the recent ones announced by Plubtieng et al. (2007, Beg and Thakur (2009, and Saluja and Nashine (2012.

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

  17. Asymptotic solution for EI Nino-southern oscillation of nonlinear model

    Institute of Scientific and Technical Information of China (English)

    MO Jia-qi; LIN Wan-tao

    2008-01-01

    A class of nonlinear coupled system for E1 Nino-Southern Oscillation (ENSO) model is considered. Using the asymptotic theory and method of variational iteration, the asymptotic expansion of the solution for ENSO models is obtained.

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

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

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

  1. Iterative Refinement Methods for Time-Domain Equalizer Design

    Science.gov (United States)

    Arslan, Güner; Lu, Biao; Clark, Lloyd D.; Evans, Brian L.

    2006-12-01

    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[InlineEquation not available: see fulltext.] 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.

  2. MULTILEVEL ITERATION METHODS FOR SOLVING LINEAR ILL-POSED PROBLEMS

    Institute of Scientific and Technical Information of China (English)

    2005-01-01

    In this paper we develop multilevel iteration methods for solving linear systems resulting from the Galerkin method and Tikhonov regularization for ill-posed problems. The algorithm and its convergence analysis are presented in an abstract framework.

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

  4. A WEIGHTED ITERATIVE METHOD FOR ROBUST SELF-CALIBRATION

    Institute of Scientific and Technical Information of China (English)

    Liu Shigang; Wu Chengke; Tang Li; Jia Jing

    2006-01-01

    A robust self-calibration method is presented, which can efficiently discard the outliers based on a Weighted Iteration Method (WIM). The method is an iterative process in which the projective reconstruction is obtained based on the weights of all the points, whereas the weights are defined in inverse proportion to the reciprocal of the re-projective errors. The weights of outliers trend to zero after several iterations, and the accurate projective reconstruction is determined. The location of the absolute conic and the camera intrinsic parameters are obtained after the projective reconstruction. The theory and experiments with both simulate and real data demonstrate that the proposed method is very efficient and robust.

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

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

  7. Iterative regularization methods for nonlinear ill-posed problems

    CERN Document Server

    Scherzer, Otmar; Kaltenbacher, Barbara

    2008-01-01

    Nonlinear inverse problems appear in many applications, and typically they lead to mathematical models that are ill-posed, i.e., they are unstable under data perturbations. Those problems require a regularization, i.e., a special numerical treatment. This book presents regularization schemes which are based on iteration methods, e.g., nonlinear Landweber iteration, level set methods, multilevel methods and Newton type methods.

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

  9. Conference on iterative methods for large linear systems

    Energy Technology Data Exchange (ETDEWEB)

    Kincaid, D.R. [comp.

    1988-12-01

    This conference is dedicated to providing an overview of the state of the art in the use of iterative methods for solving sparse linear systems with an eye to contributions of the past, present and future. The emphasis is on identifying current and future research directions in the mainstream of modern scientific computing. Recently, the use of iterative methods for solving linear systems has experienced a resurgence of activity as scientists attach extremely complicated three-dimensional problems using vector and parallel supercomputers. Many research advances in the development of iterative methods for high-speed computers over the past forty years are reviewed, as well as focusing on current research.

  10. An iterative decoupling solution method for large scale Lyapunov equations

    Science.gov (United States)

    Athay, T. M.; Sandell, N. R., Jr.

    1976-01-01

    A great deal of attention has been given to the numerical solution of the Lyapunov equation. A useful classification of the variety of solution techniques are the groupings of direct, transformation, and iterative methods. The paper summarizes those methods that are at least partly favorable numerically, giving special attention to two criteria: exploitation of a general sparse system matrix structure and efficiency in resolving the governing linear matrix equation for different matrices. An iterative decoupling solution method is proposed as a promising approach for solving large-scale Lyapunov equation when the system matrix exhibits a general sparse structure. A Fortran computer program that realizes the iterative decoupling algorithm is also discussed.

  11. ACCELERATION METHODS OF NONLINEAR ITERATION FOR NONLINEAR PARABOLIC EQUATIONS

    Institute of Scientific and Technical Information of China (English)

    Guang-wei Yuan; Xu-deng Hang

    2006-01-01

    This paper discusses the accelerating iterative methods for solving the implicit scheme of nonlinear parabolic equations. Two new nonlinear iterative methods named by the implicit-explicit quasi-Newton (IEQN) method and the derivative free implicit-explicit quasi-Newton (DFIEQN) method are introduced, in which the resulting linear equations from the linearization can preserve the parabolic characteristics of the original partial differential equations. It is proved that the iterative sequence of the iteration method can converge to the solution of the implicit scheme quadratically. Moreover, compared with the Jacobian Free Newton-Krylov (JFNK) method, the DFIEQN method has some advantages, e.g., its implementation is easy, and it gives a linear algebraic system with an explicit coefficient matrix, so that the linear (inner) iteration is not restricted to the Krylov method. Computational results by the IEQN, DFIEQN, JFNK and Picard iteration meth-ods are presented in confirmation of the theory and comparison of the performance of these methods.

  12. Mixed direct-iterative methods for boundary integral formulations of continuum dielectric solvation models

    Energy Technology Data Exchange (ETDEWEB)

    Corcelli, S.A.; Kress, J.D.; Pratt, L.R.

    1995-08-07

    This paper develops and characterizes mixed direct-iterative methods for boundary integral formulations of continuum dielectric solvation models. We give an example, the Ca{sup ++}{hor_ellipsis}Cl{sup {minus}} pair potential of mean force in aqueous solution, for which a direct solution at thermal accuracy is difficult and, thus for which mixed direct-iterative methods seem necessary to obtain the required high resolution. For the simplest such formulations, Gauss-Seidel iteration diverges in rare cases. This difficulty is analyzed by obtaining the eigenvalues and the spectral radius of the non-symmetric iteration matrix. This establishes that those divergences are due to inaccuracies of the asymptotic approximations used in evaluation of the matrix elements corresponding to accidental close encounters of boundary elements on different atomic spheres. The spectral radii are then greater than one for those diverging cases. This problem is cured by checking for boundary element pairs closer than the typical spatial extent of the boundary elements and for those cases performing an ``in-line`` Monte Carlo integration to evaluate the required matrix elements. These difficulties are not expected and have not been observed for the thoroughly coarsened equations obtained when only a direct solution is sought. Finally, we give an example application of hybrid quantum-classical methods to deprotonation of orthosilicic acid in water.

  13. On the Monotone Iterative Method for Set Valued Equation

    Institute of Scientific and Technical Information of China (English)

    2000-01-01

    This paper deals with the monotone iterative method for set- valued operator equation in ordered normed space. Some results for the case of single valued operator are generalized here, as an application, a discontinuous nonlinear differential equation problem is discussed.

  14. The AOR Iterative Method for Preconditioned Linear Systems

    Institute of Scientific and Technical Information of China (English)

    WANG Zhuan-de; GAO Zhong-xi; HUANG Ting-zhu

    2004-01-01

    The preconditioned methods for solving linear system are discussed The convergence rate of accelerated overrelaxation (AOR) method can be enlarged by using the preconditioned method when the classical AOR method converges, and the preconditioned method is invalid when the classical iterative method does not converge. The results in corresponding references are improved and perfected.

  15. A Multi-Grid Iterative Method for Photoacoustic Tomography.

    Science.gov (United States)

    Javaherian, Ashkan; Holman, Sean

    2016-11-04

    Inspired by the recent advances on minimizing nonsmooth or bound-constrained convex functions on models using varying degrees of fidelity, we propose a line search multigrid (MG) method for full-wave iterative image reconstruction in photoacoustic tomography (PAT) in heterogeneous media. To compute the search direction at each iteration, we decide between the gradient at the target level, or alternatively an approximate error correction at a coarser level, relying on some predefined criteria. To incorporate absorption and dispersion, we derive the analytical adjoint directly from the first-order acoustic wave system. The effectiveness of the proposed method is tested on a total-variation penalized Iterative Shrinkage Thresholding algorithm (ISTA) and its accelerated variant (FISTA), which have been used in many studies of image reconstruction in PAT. The results show the great potential of the proposed method in improving speed of iterative image reconstruction.

  16. Modified Ishikawa Iteration Process for Asymptotically Nonexpansive Mappings%渐近非扩张映象的修正的Ishikawa迭代程序

    Institute of Scientific and Technical Information of China (English)

    曾六川

    2003-01-01

    The purpose of this paper is to investigate the strong convergence of the modified Ishikawa iterative process for fixed points of asymptotically nonexpansive mappings in uniformly convex Banach spaces. Our results unify, generalize and improve some recent results in the present references.%本文研究一致凸Banach空间中关于渐近非扩张映象不动点的修正的Ishikawa迭代程序的强收敛性.本文结果统一,推广与改进了目前文献中的一些最新结果.

  17. A new modified block iterative algorithm for uniformly quasi-ϕ-asymptotically nonexpansive mappings and a system of generalized mixed equilibrium problems

    Directory of Open Access Journals (Sweden)

    Saewan Siwaporn

    2011-01-01

    Full Text Available Abstract In this paper, we introduce a new modified block iterative algorithm for finding a common element of the set of common fixed points of an infinite family of closed and uniformly quasi-ϕ-asymptotically nonexpansive mappings, the set of the variational inequality for an α-inverse-strongly monotone operator, and the set of solutions of a system of generalized mixed equilibrium problems. We obtain a strong convergence theorem for the sequences generated by this process in a 2-uniformly convex and uniformly smooth Banach space. Our results extend and improve ones from several earlier works. 2000 MSC: 47H05; 47H09; 47H10.

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

  19. Material nonlinear analysis via mixed-iterative finite element method

    Science.gov (United States)

    Sutjahjo, Edhi; Chamis, Christos C.

    1992-01-01

    The performance of elastic-plastic mixed-iterative analysis is examined through a set of convergence studies. Membrane and bending behaviors are tested using 4-node quadrilateral finite elements. The membrane result is excellent, which indicates the implementation of elastic-plastic mixed-iterative analysis is appropriate. On the other hand, further research to improve bending performance of the method seems to be warranted.

  20. Asymptotic Behavior of the Finite Difference and the Finite Element Methods for Parabolic Equations

    Institute of Scientific and Technical Information of China (English)

    LIU Yang; FENG Hui

    2005-01-01

    The asymptotic convergence of the solution of the parabolic equation is proved. By the eigenvalues estimation, we obtain that the approximate solutions by the finite difference method and the finite element method are asymptotically convergent. Both methods are considered in continuous time.

  1. Asymptotic Performance of Sparse Signal Detection Using Convex Programming Method

    Institute of Scientific and Technical Information of China (English)

    LEI Chuan; ZHANG Jun

    2012-01-01

    The detection of sparse signals against background noise is considered.Detecting signals of such kind is difficult since only a small portion of the signal carries information.Prior knowledge is usually assumed to ease detection.In this paper,we consider the general unknown and arbitrary sparse signal detection problem when no prior knowledge is available.Under a Neyman-Pearson hypothesis-testing framework,a new detection scheme is proposed by combining a generalized likelihood ratio test (GLRT)-like test statistic and convex programming methods which directly exploit sparsity in an underdetermined system of linear equations.We characterize large sample behavior of the proposed method by analyzing its asymptotic performance.Specifically,we give the condition for the Chernoff-consistent detection which shows that the proposed method is very sensitive to the (e)2 norm energy of the sparse signals.Both the false alarm rate and the miss rate tend to zero at vanishing signal-to-noise ratio (SNR),as long as the signal energy grows at least logarithmically with the problem dimension.Next we give a large deviation analysis to characterize the error exponent for the Neyman-Pearson detection.We derive the oracle error exponent assuming signal knowledge.Then we explicitly derive the error exponent of the proposed scheme and compare it with the oracle exponent.We complement our study with numerical experiments,showing that the proposed method performs in the vicinity of the likelihood ratio test (LRT) method in the finite sample scenario and the error probability degrades exponentially with the number of observations.

  2. Some optimal iterative methods and their with memory variants

    Directory of Open Access Journals (Sweden)

    F. Soleymani

    2013-07-01

    Full Text Available Based on the fourth-order method of Liu et al. [10], eighth-order three-step iterative methods without memory, which are totally free from derivative calculation and reach the optimal efficiency index are presented. The extension of one of the methods for multiple zeros without the knowledge of multiplicity is presented. Further accelerations will be provided through the concept of with memory iteration methods. Moreover, it is shown by way of illustration that the novel methods are useful on a series of relevant numerical problems when high precision computing is required.

  3. An Iterative Brinkman penalization for particle vortex methods

    Science.gov (United States)

    Walther, J. H.; Hejlesen, M. M.; Leonard, A.; Koumoutsakos, P.

    2013-11-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 penalization method can result in an insufficient enforcement of solid boundaries. The specific problems of the conventional penalization method is discussed and three examples are presented by which the method in its current form has shown to be insufficient to consistently enforce the no-slip boundary 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 method for each of the presented flow cases.

  4. 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...... an efficient method for estimating the probability distribution of stiffnesses for the offshore monopile foundation....

  5. An Implicit Iteration Process for Common Fixed Points of Two Infinite Families of Asymptotically Nonexpansive Mappings in Banach Spaces

    Directory of Open Access Journals (Sweden)

    Wei-Qi Deng

    2013-01-01

    Full Text Available Let be a nonempty, closed, and convex subset of a real uniformly convex Banach space . Let and be two infinite families of asymptotically nonexpansive mappings from to itself with . For an arbitrary initial point , is defined as follows: , , , where and with and satisfying the positive integer equation: , ; and are two countable subsets of and respectively; , , , , , and are sequences in for some , satisfying and . Under some suitable conditions, a strong convergence theorem for common fixed points of the mappings and is obtained. The results extend those of the authors whose related researches are restricted to the situation of finite families of asymptotically nonexpansive mappings.

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

  7. MODIFIED BERNOULLI ITERATION METHODS FOR QUADRATIC MATRIX EQUATION

    Institute of Scientific and Technical Information of China (English)

    Zhong-Zhi Bai; Yong-Hua Gao

    2007-01-01

    We construct a modified Bernoulli iteration method for solving the quadratic matrix equation AX2+BX+C=0,where A,B and C are square matrices.This method is motivated from the Gauss-Seidel iteration for solving linear systems and the ShermanMorrison-Woodbury formula for updating matrices.Under suitable conditions, we prove the local linear convergence of the Dew method.An algorithm is presented to find the solution of the quadratic matrix equation and some numerical results are given to show the feasibility and the effectiveness of the algorithm.In addition,we also describe and analyze the block version of the modified Bernoulli iteration method.

  8. Iterative Methods for MPC on Graphical Processing Units

    DEFF Research Database (Denmark)

    2012-01-01

    The high oating point performance and memory bandwidth of Graphical Processing Units (GPUs) makes them ideal for a large number of computations which often arises in scientic computing, such as matrix operations. GPUs achieve this performance by utilizing massive par- allelism, which requires...... on their applicability for GPUs. We examine published techniques for iterative methods in interior points methods (IPMs) by applying them to simple test cases, such as a system of masses connected by springs. Iterative methods allows us deal with the ill-conditioning occurring in the later iterations of the IPM as well...... as to avoid the use of dense matrices, which may be too large for the limited memory capacity of current graphics cards....

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

  10. APPLICATIONS OF STAIR MATRICES AND THEIR GENERALIZATIONS TO ITERATIVE METHODS

    Institute of Scientific and Technical Information of China (English)

    SHAO Xin-hui; SHEN Hai-long; LI Chang-jun

    2006-01-01

    Stair matrices and their generalizations are introduced. The definitions and some properties of the matrices were first given by Lu Hao. This class of matrices provide bases of matrix splittings for iterative methods. The remarkable feature of iterative methods based on the new class of matrices is that the methods are easily implemented for parallel computation. In particular, a generalization of the accelerated overrelaxation method (GAOR) is introduced. Some theories of the AOR method are extended to the generalized method to include a wide class of matrices. The convergence of the new method is derived for Hermitian positive definite matrices. Finally, some examples are given in order to show the superiority of the new method.

  11. Chaotic block iterating method for pseudo-random sequence generator

    Institute of Scientific and Technical Information of China (English)

    CHEN Shuai; ZHONG Xian-xin

    2007-01-01

    A pseudo-random sequence generator is a basic tool for cryptography. To realize a pseudo-random sequence generator, a new block iterating method using shifter, multiplier,and adder operations has been introduced. By increasing the iteration of the counter and by performing calculations based on the initial value, an approximate pseudo-random sequence was obtained after exchanging bits. The algorithm and the complexity of the generator were introduced. The result obtained from the calculation shows that the self-correlation of the "m" block sequence is two-valued; the block field value is [0,2m - 1 ], and the block period is 2m+8 - 1.

  12. Asymptotic analytical methods in fluid mechanics related to drag prediction

    Science.gov (United States)

    Inger, G. R.

    1975-01-01

    Some recent theoretical work of a purely analytical nature is described which promises to provide engineering predictions for the important drag-related phenomena of flow in the stall regime. This analytical work deals with rigorous asymptotic studies of the complete Navier-Stokes equations that govern the viscous flow around any aerodynamic body under conditions where boundary layer separation takes place from the body surface.

  13. Noise-insensitive iterative method for interferogram processing

    Science.gov (United States)

    Kotlyar, V. V.; Seraphimovich, P. G.; Zalyalov, O. K.

    1995-08-01

    We have developed and numerically evaluated an iterative algorithm for interferogram processing, which includes the Fourier-transform method, the Gerchberg-Papoulis algorithm and Wiener's filter-based regularization used in combination. Using a signal-to-noise ratio of not less than 1, it has been possible to reconstruct the phase of an object field with an accuracy better than 5%.

  14. An Iterative Phase-Space Explicit Discontinuous Galerkin Method for Stellar Radiative Transfer in Extended Atmospheres

    Energy Technology Data Exchange (ETDEWEB)

    de Almeida, V.F.

    2004-01-28

    A phase-space discontinuous Galerkin (PSDG) method is presented for the solution of stellar radiative transfer problems. It allows for greater adaptivity than competing methods without sacrificing generality. The method is extensively tested on a spherically symmetric, static, inverse-power-law scattering atmosphere. Results for different sizes of atmospheres and intensities of scattering agreed with asymptotic values. The exponentially decaying behavior of the radiative field in the diffusive-transparent transition region and the forward peaking behavior at the surface of extended atmospheres were accurately captured. The integrodifferential equation of radiation transfer is solved iteratively by alternating between the radiative pressure equation and the original equation with the integral term treated as an energy density source term. In each iteration, the equations are solved via an explicit, flux-conserving, discontinuous Galerkin method. Finite elements are ordered in wave fronts perpendicularly to the characteristic curves so that elemental linear algebraic systems are solved quickly by sweeping the phase space element by element. Two implementations of a diffusive boundary condition at the origin are demonstrated wherein the finite discontinuity in the radiative intensity is accurately captured by the proposed method. This allows for a consistent mechanism to preserve photon luminosity. The method was proved to be robust and fast, and a case is made for the adequacy of parallel processing. In addition to classical two-dimensional plots, results of normalized radiative intensity were mapped onto a log-polar surface exhibiting all distinguishing features of the problem studied.

  15. SERIES PERTURBATIONS APPROXIMATE SOLUTIONS TO N-S EQUATIONS AND MODIFICATION TO ASYMPTOTIC EXPANSION MATCHED METHOD

    Institute of Scientific and Technical Information of China (English)

    李大鸣; 张红萍; 高永祥

    2002-01-01

    A method that series perturbations approximate solutions to N-S equations with boundary conditions was discussed and adopted. Then the method was proved in which the asymptotic solutions of viscous fluid flow past a sphere were deducted. By the ameliorative asymptotic expansion matched method, the matched functions are determined easily and the ameliorative curve of drag coefficient is coincident well with measured data in the case that Reynolds number is less than or equal to 40 000.

  16. AN ASYMPTOTIC ANALYSIS METHOD FOR THE LINEAR SHELL

    Institute of Scientific and Technical Information of China (English)

    李开泰; 张文岭; 黄艾香

    2004-01-01

    In this paper, using the formal approach of asymptotic expansion for linear elastic shell we can get each term uk successively. According this metnod the leading term u0 will be identified by an elliptic boundary value problem, other terms will be obtained by the algebraic operations without solving partial differential equations. We give the variational formulation for the leading term U(x) and construct an approximate solution UKT(x,ζ):=U(x)+Ⅱ1Uζ+Ⅱ2Uζ2,then we give the estimation.

  17. Filtered Iterative Reconstruction (FIR) via Proximal Forward-Backward Splitting: A Synergy of Analytical and Iterative Reconstruction Method for CT

    CERN Document Server

    Gao, Hao

    2015-01-01

    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. Specifically, 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 convergenc...

  18. Soft Error Vulnerability of Iterative Linear Algebra Methods

    Energy Technology Data Exchange (ETDEWEB)

    Bronevetsky, G; de Supinski, B

    2008-01-19

    Devices are increasingly vulnerable to soft errors as their feature sizes shrink. Previously, soft error rates were significant primarily in space and high-atmospheric computing. Modern architectures now use features so small at sufficiently low voltages that soft errors are becoming important even at terrestrial altitudes. Due to their large number of components, supercomputers are particularly susceptible to soft errors. Since many large scale parallel scientific applications use iterative linear algebra methods, the soft error vulnerability of these methods constitutes a large fraction of the applications overall vulnerability. Many users consider these methods invulnerable to most soft errors since they converge from an imprecise solution to a precise one. However, we show in this paper that iterative methods are vulnerable to soft errors, exhibiting both silent data corruptions and poor ability to detect errors. Further, we evaluate a variety of soft error detection and tolerance techniques, including checkpointing, linear matrix encodings, and residual tracking techniques.

  19. Object-oriented design of preconditioned iterative methods

    Energy Technology Data Exchange (ETDEWEB)

    Bruaset, A.M. [SINTEF, Oslo (Norway)

    1994-12-31

    In this talk the author discusses how object-oriented programming techniques can be used to develop a flexible software package for preconditioned iterative methods. The ideas described have been used to implement the linear algebra part of Diffpack, which is a collection of C++ class libraries that provides high-level tools for the solution of partial differential equations. In particular, this software package is aimed at rapid development of PDE-based numerical simulators, primarily using finite element methods.

  20. Landweber Iterative Methods for Angle-limited Image Reconstruction

    Institute of Scientific and Technical Information of China (English)

    Gang-rong Qu; Ming Jiang

    2009-01-01

    We introduce a general itcrative scheme for angle-limited image reconstruction based on Landwe-ber's method. We derive a representation formula for this scheme and consequently establish its convergence conditions. Our results suggest certain relaxation strategies for an accelerated convergcnce for angle-limited im-age reconstruction in L2-norm comparing with alternative projection methods. The convolution-backprojection algorithm is given for this iterative process.

  1. Modified Block Iterative Method for Solving Convex Feasibility Problem, Equilibrium Problems and Variational Inequality Problems

    Institute of Scientific and Technical Information of China (English)

    Shi Sheng ZHANG; Chi Kin CHAN; H.W. JOSEPH LEE

    2012-01-01

    The purpose of this paper is by using the modified block iterative method to propose an algorithm for finding a common element in the intersection of the set of common fixed points of an infinite family of quasi-φ-asymptotically nonexpansive and the set of solutions to an equilibrium problem and the set of solutions to a variational inequality.Under suitable conditions some strong convergence theorems are established in 2-uniformly convex and uniformly smooth Banach spaces.As applications we utilize the results presented in the paper to solving the convex feasibility problem (CFP) and zero point problem of maximal monotone mappings in Banach spaces.The results presented in the paper improve and extend the corresponding results announced by many authors.

  2. Co-iterative augmented Hessian method for orbital optimization

    CERN Document Server

    Sun, Qiming

    2016-01-01

    Orbital optimization procedure is widely called in electronic structure simulation. To efficiently find the orbital optimization solution, we developed a new second order orbital optimization algorithm, co-iteration augmented Hessian (CIAH) method. In this method, the orbital optimization is embedded in the diagonalization procedure for augmented Hessian (AH) eigenvalue equation. Hessian approximations can be easily employed in this method to improve the computational costs. We numerically performed the CIAH algorithm with SCF convergence of 20 challenging systems and Boys localization of C60 molecule. We found that CIAH algorithm has better SCF convergence and less computational costs than direct inversion iterative subspace (DIIS) algorithm. The numerical tests suggest that CIAH is a stable, reliable and efficient algorithm for orbital optimization problem.

  3. Iterative methods for simultaneous inclusion of polynomial zeros

    CERN Document Server

    Petković, Miodrag

    1989-01-01

    The simultaneous inclusion of polynomial complex zeros is a crucial problem in numerical analysis. Rapidly converging algorithms are presented in these notes, including convergence analysis in terms of circular regions, and in complex arithmetic. Parallel circular iterations, where the approximations to the zeros have the form of circular regions containing these zeros, are efficient because they also provide error estimates. There are at present no book publications on this topic and one of the aims of this book is to collect most of the algorithms produced in the last 15 years. To decrease the high computational cost of interval methods, several effective iterative processes for the simultaneous inclusion of polynomial zeros which combine the efficiency of ordinary floating-point arithmetic with the accuracy control that may be obtained by the interval methods, are set down, and their computational efficiency is described. The rate of these methods is of interest in designing a package for the simultaneous ...

  4. Iterative methods for stationary convection-dominated transport problems

    Energy Technology Data Exchange (ETDEWEB)

    Bova, S.W.; Carey, G.F. [Univ. of Texas, Austin, TX (United States)

    1994-12-31

    It is well known that many iterative methods fail when applied to nonlinear systems of convection-dominated transport equations. Most successful methods for obtaining steady-state solutions to such systems rely on time-stepping through an artificial transient, combined with careful construction of artificial dissipation operators. These operators provide control over spurious oscillations which pollute the steady state solutions, and, in the nonlinear case, may become amplified and lead to instability. In the present study, we investigate Taylor Galerkin and SUPG-type methods and compare results for steady-state solutions to the Euler equations of gas dynamics. In particular, we consider the efficiency of different iterative strategies and present results for representative two-dimensional calculations.

  5. On the interplay between inner and outer iterations for a class of iterative methods

    Energy Technology Data Exchange (ETDEWEB)

    Giladi, E. [Stanford Univ., CA (United States)

    1994-12-31

    Iterative algorithms for solving linear systems of equations often involve the solution of a subproblem at each step. This subproblem is usually another linear system of equations. For example, a preconditioned iteration involves the solution of a preconditioner at each step. In this paper, the author considers algorithms for which the subproblem is also solved iteratively. The subproblem is then said to be solved by {open_quotes}inner iterations{close_quotes} while the term {open_quotes}outer iteration{close_quotes} refers to a step of the basic algorithm. The cost of performing an outer iteration is dominated by the solution of the subproblem, and can be measured by the number of inner iterations. A good measure of the total amount of work needed to solve the original problem to some accuracy c is then, the total number of inner iterations. To lower the amount of work, one can consider solving the subproblems {open_quotes}inexactly{close_quotes} i.e. not to full accuracy. Although this diminishes the cost of solving each subproblem, it usually slows down the convergence of the outer iteration. It is therefore interesting to study the effect of solving each subproblem inexactly on the total amount of work. Specifically, the author considers strategies in which the accuracy to which the inner problem is solved, changes from one outer iteration to the other. The author seeks the `optimal strategy`, that is, the one that yields the lowest possible cost. Here, the author develops a methodology to find the optimal strategy, from the set of slowly varying strategies, for some iterative algorithms. This methodology is applied to the Chebychev iteration and it is shown that for Chebychev iteration, a strategy in which the inner-tolerance remains constant is optimal. The author also estimates this optimal constant. Then generalizations to other iterative procedures are discussed.

  6. Soft Error Vulnerability of Iterative Linear Algebra Methods

    Energy Technology Data Exchange (ETDEWEB)

    Bronevetsky, G; de Supinski, B

    2007-12-15

    Devices become increasingly vulnerable to soft errors as their feature sizes shrink. Previously, soft errors primarily caused problems for space and high-atmospheric computing applications. Modern architectures now use features so small at sufficiently low voltages that soft errors are becoming significant even at terrestrial altitudes. The soft error vulnerability of iterative linear algebra methods, which many scientific applications use, is a critical aspect of the overall application vulnerability. These methods are often considered invulnerable to many soft errors because they converge from an imprecise solution to a precise one. However, we show that iterative methods can be vulnerable to soft errors, with a high rate of silent data corruptions. We quantify this vulnerability, with algorithms generating up to 8.5% erroneous results when subjected to a single bit-flip. Further, we show that detecting soft errors in an iterative method depends on its detailed convergence properties and requires more complex mechanisms than simply checking the residual. Finally, we explore inexpensive techniques to tolerate soft errors in these methods.

  7. Computation of saddle-type slow manifolds using iterative methods

    DEFF Research Database (Denmark)

    Kristiansen, Kristian Uldall

    2015-01-01

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

  8. Comparison Results Between Preconditioned Jacobi and the AOR Iterative Method

    Institute of Scientific and Technical Information of China (English)

    Wei Li; Jicheng Li

    2007-01-01

    The large scale linear systems with M-matrices often appear in a wide variety of areas of physical, fluid dynamics and economic sciences. It is reported in [1] that the convergence rate of the IMGS method, with the preconditioner I + Sα, is superior to that of the basic SOR iterative method for the M-matrix. This paper considers the preconditioned Jacobi (PJ) method with the preconditioner P = I + Sα + Sβ, and proves theoretically that the convergence rate of the PJ method is better than that of the basic AOR method. Numerical examples are provided to illustrate the main results obtained.

  9. An Alternating Iterative Method and Its Application in Statistical Inference

    Institute of Scientific and Technical Information of China (English)

    Ning Zhong SHI; Guo Rong HU; Qing CUI

    2008-01-01

    This paper studies non-convex programming problems. It is known that, in statistical inference, many constrained estimation problems may be expressed as convex programming problems. However, in many practical problems, the objective functions are not convex. In this paper, we give a definition of a semi-convex objective function and discuss the corresponding non-convex programming problems. A two-step iterative algorithm called the alternating iterative method is proposed for finding solutions for such problems. The method is illustrated by three examples in constrained estimation problems given in Sasabuchi et al. (Biometrika, 72, 465–472 (1983)), Shi N. Z. (J. Multivariate Anal.,50, 282–293 (1994)) and El Barmi H. and Dykstra R. (Ann. Statist., 26, 1878–1893 (1998)).

  10. Properties and Iterative Methods for the Q-Lasso

    Directory of Open Access Journals (Sweden)

    Maryam A. Alghamdi

    2013-01-01

    are taken to recover a signal/image via the lasso. Solutions of the Q-lasso depend on a tuning parameter γ. In this paper, we obtain basic properties of the solutions as a function of γ. Because of ill posedness, we also apply l1-l2 regularization to the Q-lasso. In addition, we discuss iterative methods for solving the Q-lasso which include the proximal-gradient algorithm and the projection-gradient algorithm.

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

  12. The renormalization method based on the Taylor expansion and applications for asymptotic analysis

    CERN Document Server

    Liu, Cheng-shi

    2016-01-01

    Based on the Taylor expansion, we propose a renormalization method for asymptotic analysis. The standard renormalization group (RG) method for asymptotic analysis can be derived out from this new method, and hence the mathematical essence of the RG method is also recovered. The biggest advantage of the proposed method is that the secular terms in perturbation series are automatically eliminated, but in usual perturbation theory, we need more efforts and tricks to eliminate these terms. At the same time, the mathematical foundation of the method is simple and the logic of the method is very clear, therefore, it is very easy in practice. As application, we obtain the uniform valid asymptotic solutions to some problems including vector field, boundary layer and boundary value problems of nonlinear wave equations. Moreover, we discuss the normal form theory and reduction equations of dynamical systems. Furthermore, by combining the topological deformation and the RG method, a modified method namely the homotopy r...

  13. Convergence on successive over-relaxed iterative methods for non-Hermitian positive definite linear systems

    Directory of Open Access Journals (Sweden)

    Cheng-yi Zhang

    2016-06-01

    Full Text Available Abstract Some convergence conditions on successive over-relaxed (SOR iterative method and symmetric SOR (SSOR iterative method are proposed for non-Hermitian positive definite linear systems. Some examples are given to demonstrate the results obtained.

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

  15. Scalable nonlinear iterative methods for partial differential equations

    Energy Technology Data Exchange (ETDEWEB)

    Cai, X-C

    2000-10-29

    We conducted a six-month investigation of the design, analysis, and software implementation of a class of singularity-insensitive, scalable, parallel nonlinear iterative methods for the numerical solution of nonlinear partial differential equations. The solutions of nonlinear PDEs are often nonsmooth and have local singularities, such as sharp fronts. Traditional nonlinear iterative methods, such as Newton-like methods, are capable of reducing the global smooth nonlinearities at a nearly quadratic convergence rate but may become very slow once the local singularities appear somewhere in the computational domain. Even with global strategies such as line search or trust region the methods often stagnate at local minima of {parallel}F{parallel}, especially for problems with unbalanced nonlinearities, because the methods do not have built-in machinery to deal with the unbalanced nonlinearities. To find the same solution u* of F(u) = 0, we solve, instead, an equivalent nonlinearly preconditioned system G(F(u*)) = 0 whose nonlinearities are more balanced. In this project, we proposed and studied a nonlinear additive Schwarz based parallel nonlinear preconditioner and showed numerically that the new method converges well even for some difficult problems, such as high Reynolds number flows, when a traditional inexact Newton method fails.

  16. Pavement crack identification based on automatic threshold iterative method

    Science.gov (United States)

    Lu, Guofeng; Zhao, Qiancheng; Liao, Jianguo; He, Yongbiao

    2017-01-01

    Crack detection is an important issue in concrete infrastructure. Firstly, the accuracy of crack geometry parameters measurement is directly affected by the extraction accuracy, the same as the accuracy of the detection system. Due to the properties of unpredictability, randomness and irregularity, it is difficult to establish recognition model of crack. Secondly, various image noise, caused by irregular lighting conditions, dark spots, freckles and bump, exerts an influence on the crack detection accuracy. Peak threshold selection method is improved in this paper, and the processing of enhancement, smoothing and denoising is conducted before iterative threshold selection, which can complete the automatic selection of the threshold value in real time and stability.

  17. A Matrix Pencil Algorithm Based Multiband Iterative Fusion Imaging Method

    Science.gov (United States)

    Zou, Yong Qiang; Gao, Xun Zhang; Li, Xiang; Liu, Yong Xiang

    2016-01-01

    Multiband signal fusion technique is a practicable and efficient way to improve the range resolution of ISAR image. The classical fusion method estimates the poles of each subband signal by the root-MUSIC method, and some good results were get in several experiments. However, this method is fragile in noise for the proper poles could not easy to get in low signal to noise ratio (SNR). In order to eliminate the influence of noise, this paper propose a matrix pencil algorithm based method to estimate the multiband signal poles. And to deal with mutual incoherent between subband signals, the incoherent parameters (ICP) are predicted through the relation of corresponding poles of each subband. Then, an iterative algorithm which aimed to minimize the 2-norm of signal difference is introduced to reduce signal fusion error. Applications to simulate dada verify that the proposed method get better fusion results at low SNR.

  18. On the relation between traditional iterative methods and modern multilevel/domain decomposition methods

    Energy Technology Data Exchange (ETDEWEB)

    Griebel, M. [Technische Universitaet Muenchen (Germany)

    1994-12-31

    In recent years, it has turned out that many modern iterative algorithms (multigrid schemes, multilevel preconditioners, domain decomposition methods etc.) for solving problems resulting from the discretization of PDEs can be interpreted as additive (Jacobi-like) or multiplicative (Gauss-Seidel-like) subspace correction methods. The key to their analysis is the study of certain metric properties of the underlying splitting of the discretization space V into a sum of subspaces V{sub j}, j = 1{hor_ellipsis}, J resp. of the variational problem on V into auxiliary problems on these subspaces. Here, the author proposes a modified approach to the abstract convergence theory of these additive and multiplicative Schwarz iterative methods, that makes the relation to traditional iteration methods more explicit. To this end he introduces the enlarged Hilbert space V = V{sub 0} x {hor_ellipsis} x V{sub j} which is nothing else but the usual construction of the Cartesian product of the Hilbert spaces V{sub j} and use it now in the discretization process. This results in an enlarged, semidefinite linear system to be solved instead of the usual definite system. Then, modern multilevel methods as well as domain decomposition methods simplify to just traditional (block-) iteration methods. Now, the convergence analysis can be carried out directly for these traditional iterations on the enlarged system, making convergence proofs of multilevel and domain decomposition methods more clear, or, at least, more classical. The terms that enter the convergence proofs are exactly the ones of the classical iterative methods. It remains to estimate them properly. The convergence proof itself follow basically line by line the old proofs of the respective traditional iterative methods. Additionally, new multilevel/domain decomposition methods are constructed straightforwardly by now applying just other old and well known traditional iterative methods to the enlarged system.

  19. Revised Iterative Solution of Ground State of Double-Well Potential

    Institute of Scientific and Technical Information of China (English)

    ZHAO Wei-Qin

    2005-01-01

    The revised new iterative method for solving the ground state of Schrodinger equation is deduced. Based on Green functions defined by quadratures along a single trajectory this iterative method is applied to solve the ground state of the double-well potential. The result is compared to the one based on the original iterative method. The limitation of the asymptotic expansion is also discussed.

  20. AN ITERATED-SUBSPACE MINIMIZATION METHODS WITH SYMMETRIC RANK-ONE UPDATING

    Institute of Scientific and Technical Information of China (English)

    徐徽宁; 孙麟平

    2004-01-01

    We consider an Iterated-Subspace Minimization(ISM) method for solving large-scale unconstrained minimization problems. At each major iteration of the method,a two-dimensional manifold, the iterated subspace, is constructed and an approximate minimizer of the objective function in this manifold then determined, and a symmetric rank-one updating is used to solve the inner minimization problem.

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

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

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

    DEFF Research Database (Denmark)

    Poulsen, Peter Noe; Damkilde, Lars

    1998-01-01

    Application of the finite element method to Koiter's asymptotic postbuckling theory often leads to numerical problems. Generally it is believed that these problems are due to locking of non-linear terms of different orders. A general method is given here that explains the reason for the numerical...... convergence of the postbuckling coefficients. (C) 1998 John Wiley & Sons, Ltd....

  4. ASYMPTOTIC SURROGATE CONSTRAINT METHOD AND ITS CONVERGENCEFOR A CLASS OF SEMI-INFINITE PROGRAMMING

    Institute of Scientific and Technical Information of China (English)

    WanZhongping; WuGuoming

    1999-01-01

    A class of constrained semi infinite minimax problem is transformed into a simpleconstrained problem, by means of discretization decoraposirion and maximum entropy method,making use of surrogate constraint, The paper deals with the convergence of this asymptotic aI-proach method.

  5. Variational iteration method for Bratu-like equation arising in electrospinning.

    Science.gov (United States)

    He, Ji-Huan; Kong, Hai-Yan; Chen, Rou-Xi; Hu, Ming-sheng; Chen, Qiao-ling

    2014-05-25

    This paper points out that the so called enhanced variational iteration method (Colantoni & Boubaker, 2014) for a nonlinear equation arising in electrospinning and vibration-electrospinning process is the standard variational iteration method. An effective algorithm using the variational iteration algorithm-II is suggested for Bratu-like equation arising in electrospinning. A suitable choice of initial guess results in a relatively accurate solution by one or few iteration.

  6. KRYLOV’S SUBSPACES ITERATIVE METHODS TO EVALUATE ELECTROSTATIC PARAMETERS

    Directory of Open Access Journals (Sweden)

    Mario Versaci

    2014-01-01

    Full Text Available Most of the electromagnetic problems can be stated in terms of an inhomogeneous equation Af = g in which A is a differential, integral or integro-differential operator, g in the exitation source and f is the unknown function to be determined. Methods of Moments (MoM is a procedure to solve the equation above and, by means of an appropriate choice of the Basis/Testing (B/T, the problem can be translated into an equivalent linear system even of bigger dimensions. In this work we investigate on how the performances of the major Krylov’s subspace iterative solvers are affected by different choice of these sets of functions. More specifically, as a test case, we consider the algebric linear system of equations obtained by an electrostatic problem of evaluation of the capacitance and electrostatic charge distribution in a cylindrical conductor of finite length. Results are compared in terms of analytical/computational complexity and speed of convergence by exploiting three leading iterative methods (GMRES, CGS, BibGStab and B/T functions of Pulse/Pulse (P/P and Pulse/Delta (P/D type.

  7. Computer methods for ITER-like materials LIBS diagnostics

    Science.gov (United States)

    Łepek, Michał; Gąsior, Paweł

    2014-11-01

    Recent development of Laser-Induced Breakdown Spectroscopy (LIBS) caused that this method is considered as the most promising for future diagnostic applications for characterization of the deposited materials in the International Thermonuclear Experimental Reactor (ITER), which is currently under construction. In this article the basics of LIBS are shortly discussed and the software for spectra analyzing is presented. The main software function is to analyze measured spectra with respect to the certain element lines presence. Some program operation results are presented. Correct results for graphite and aluminum are obtained although identification of tungsten lines is a problem. The reason for this is low tungsten lines intensity, and thus low signal to noise ratio of the measured signal. In the second part artificial neural networks (ANNs) as the next step for LIBS spectra analyzing are proposed. The idea is focused on multilayer perceptron network (MLP) with backpropagation learning method. The potential of ANNs for data processing was proved through application in several LIBS-related domains, e.g. differentiating ancient Greek ceramics (discussed). The idea is to apply an ANN for determination of W, Al, C presence on ITER-like plasma-facing materials.

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

  9. Iterative Methods for Scalable Uncertainty Quantification in Complex Networks

    CERN Document Server

    Surana, Amit; Banaszuk, Andrzej

    2011-01-01

    In this paper we address the problem of uncertainty management for robust design, and verification of large dynamic networks whose performance is affected by an equally large number of uncertain parameters. Many such networks (e.g. power, thermal and communication networks) are often composed of weakly interacting subnetworks. We propose intrusive and non-intrusive iterative schemes that exploit such weak interconnections to overcome dimensionality curse associated with traditional uncertainty quantification methods (e.g. generalized Polynomial Chaos, Probabilistic Collocation) and accelerate uncertainty propagation in systems with large number of uncertain parameters. This approach relies on integrating graph theoretic methods and waveform relaxation with generalized Polynomial Chaos, and Probabilistic Collocation, rendering these techniques scalable. We analyze convergence properties of this scheme and illustrate it on several examples.

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

  11. Efficient DPCA SAR imaging with fast iterative spectrum reconstruction method

    Institute of Scientific and Technical Information of China (English)

    FANG Jian; ZENG JinShan; XU ZongBen; ZHAO Yao

    2012-01-01

    The displaced phase center antenna (DPCA) technique is an effective strategy to achieve wide-swath synthetic aperture radar (SAR) imaging with high azimuth resolution.However,traditionally,it requires strict limitation of the pulse repetition frequency (PRF) to avoid non-uniform sampling.Otherwise,any deviation could bring serious ambiguity if the data are directly processed using a matched filter.To break this limitation,a recently proposed spectrum reconstruction method is capable of recovering the true spectrum from the nonuniform samples. However,the performance is sensitive to the selection of the PRF.Sparse regularization based imaging may provide a way to overcome this sensitivity. The existing time-domain method,however,requires a large-scale observation matrix to be built,which brings a high computational cost.In this paper,we propose a frequency domain method,called the iterative spectrum reconstruction method,through integration of the sparse regularization technique with spectrum analysis of the DPCA signal.By approximately expressing the observation in the frequency domain,which is realized via a series of decoupled linear operations,the method performs SAR imaging which is then not directly based on the observation matrix,which reduces the computational cost from O(N2) to O(NlogN) (where N is the number of range cells),and is therefore more efficient than the time domain method. The sparse regularization scheme,realized via a fast thresholding iteration,has been adopted in this method,which brings the robustness of the imaging process to the PRF selection.We provide a series of simulations and ground based experiments to demonstrate the high efficiency and robustness of the method.The simulations show that the new method is almost as fast as the traditional mono-channel algorithm,and works well almost independently of the PRF selection.Consequently,the suggested method can be accepted as a practical and efficient wide-swath SAR imaging technique.

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

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

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

  15. Numerical Solution of Riccati Equations by the Adomian and Asymptotic Decomposition Methods over Extended Domains

    Directory of Open Access Journals (Sweden)

    Jafar Biazar

    2015-01-01

    Full Text Available We combine the Adomian decomposition method (ADM and Adomian’s asymptotic decomposition method (AADM for solving Riccati equations. We investigate the approximate global solution by matching the near-field approximation derived from the Adomian decomposition method with the far-field approximation derived from Adomian’s asymptotic decomposition method for Riccati equations and in such cases when we do not find any region of overlap between the obtained approximate solutions by the two proposed methods, we connect the two approximations by the Padé approximant of the near-field approximation. We illustrate the efficiency of the technique for several specific examples of the Riccati equation for which the exact solution is known in advance.

  16. 精化的二次残量迭代法%A REFINED RESIDUAL ITERATION METHOD

    Institute of Scientific and Technical Information of China (English)

    贾仲孝; 孙玉泉

    2004-01-01

    According to the refined projection principle advocated by Jia[8], we improve the residual iteration method of quadratic eigenvalue problems and propose a refined residual iteration method. We study the restarting issue of the method and develop a practical algorithm. Preliminary numerical examples illustrate the efficiency of the method.

  17. A Family of Fifth-order Iterative Methods for Solving Nonlinear Equations

    Institute of Scientific and Technical Information of China (English)

    Liu Tian-Bao; Cai Hua

    2013-01-01

    In this paper, we present and analyze a family of fifth-order iterative methods free from second derivative for solving nonlinear equations. It is established that the family of iterative methods has convergence order five. Numerical examples show that the new methods are comparable with the well known existing methods and give better results in many aspects.

  18. Revised Variational Iteration Method for Solving Systems of Nonlinear Fractional-Order Differential Equations

    Directory of Open Access Journals (Sweden)

    C. Ünlü

    2013-01-01

    Full Text Available A modification of the variational iteration method (VIM for solving systems of nonlinear fractional-order differential equations is proposed. The fractional derivatives are described in the Caputo sense. The solutions of fractional differential equations (FDE obtained using the traditional variational iteration method give good approximations in the neighborhood of the initial position. The main advantage of the present method is that it can accelerate the convergence of the iterative approximate solutions relative to the approximate solutions obtained using the traditional variational iteration method. Illustrative examples are presented to show the validity of this modification.

  19. DIVA: an iterative method for building modular integrated models

    Science.gov (United States)

    Hinkel, J.

    2005-08-01

    Integrated modelling of global environmental change impacts faces the challenge that knowledge from the domains of Natural and Social Science must be integrated. This is complicated by often incompatible terminology and the fact that the interactions between subsystems are usually not fully understood at the start of the project. While a modular modelling approach is necessary to address these challenges, it is not sufficient. The remaining question is how the modelled system shall be cut down into modules. While no generic answer can be given to this question, communication tools can be provided to support the process of modularisation and integration. Along those lines of thought a method for building modular integrated models was developed within the EU project DINAS-COAST and applied to construct a first model, which assesses the vulnerability of the world's coasts to climate change and sea-level-rise. The method focuses on the development of a common language and offers domain experts an intuitive interface to code their knowledge in form of modules. However, instead of rigorously defining interfaces between the subsystems at the project's beginning, an iterative model development process is defined and tools to facilitate communication and collaboration are provided. This flexible approach has the advantage that increased understanding about subsystem interactions, gained during the project's lifetime, can immediately be reflected in the model.

  20. 一致凸Banach空间上渐近非扩张映象Ishikawa迭代的收敛定理%Convergence Theorms of Ishikawa Iterative for Asymptotically Non-expansive Mapping in a Uniformly Convex Banach space

    Institute of Scientific and Technical Information of China (English)

    苏永福

    2001-01-01

    文[4]把文[3]的主要结果从Hilbert空间推广到一致凸Banach空间,证明了一致凸Banach空间中文上从有界闭凸集到自身的渐近非扩张映象的迭代序列收敛定理.本文将有界闭凸集的条件减弱为闭凸集,从而推广了文[4]的相应结果.%In paper [4], the relative result of Jiirgen schu is extended to a uniformly convex Banach space, and the convergence of iterative sequence in an uniformly conves Banach space for asymptotically non - expanstive mapping is proved.In paper [4], T is asymptotically non - expanstive mapping with sequence {Kn} in a bounded closed convex subset C of uniformly convex Banach space.In this paper, we let only C is closed convex subset of uniformlly convex Banach space. But convergence theorms of iterative sequences for asymptotically non-expanstive mapping was also proved.

  1. Bias Correction for Alternating Iterative Maximum Likelihood Estimators

    Institute of Scientific and Technical Information of China (English)

    Gang YU; Wei GAO; Ningzhong SHI

    2013-01-01

    In this paper,we give a definition of the alternating iterative maximum likelihood estimator (AIMLE) which is a biased estimator.Furthermore we adjust the AIMLE to result in asymptotically unbiased and consistent estimators by using a bootstrap iterative bias correction method as in Kuk (1995).Two examples and simulation results reported illustrate the performance of the bias correction for AIMLE.

  2. VARIATIONAL ITERATION SOLVING METHOD FOR SEA-AIR OSCILLATOR MODEL OF INTERDECADAL CLIMATE FLUCTUATIONS

    Institute of Scientific and Technical Information of China (English)

    MO Jia-qi; LIN Yi-hua; WANG Hui

    2005-01-01

    Atmospheric physics is a very complicated natural phenomenon and needs to simplify its basic models for the sea-air oscillator. And it is solved by using the approximate method. The variational iteration method is a simple and valid method. In this paper the coupled system for a sea-air oscillator model of interdecadal climate fluctuations is considered. Firstly, through introducing a set of functions, and computing the variations, the Lagrange multipliers are obtained. And then, the generalized expressions of variational iteration are constructed. Finally, through selecting appropriate initial iteration from the iteration expressions, the approximations of solution for the sea-air oscillator model are solved successively.

  3. Asymptotically Optimal Algorithm for Short-Term Trading Based on the Method of Calibration

    CERN Document Server

    V'yugin, Vladimir

    2012-01-01

    A trading strategy based on a natural learning process, which asymptotically outperforms any trading strategy from RKHS (Reproduced Kernel Hilbert Space), is presented. In this process, the trader rationally chooses his gambles using predictions made by a randomized well calibrated algorithm. Our strategy is based on Dawid's notion of calibration with more general changing checking rules and on some modification of Kakade and Foster's randomized algorithm for computing calibrated forecasts. We use also Vovk's method of defensive forecasting in RKHS.

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

  5. Asymptotically adjusted self-consistent multiplicative parameter exchange-energy-functional method: Application to diatomic molecules

    Science.gov (United States)

    Karasiev, Valentin V.; Ludeña, Eduardo V.

    2002-03-01

    An asymptotically adjusted self-consistent α (AASCα) method is advanced for the purpose of constructing an accurate orbital-dependent local exchange potential with correct asymptotic behavior. This local potential is made up of the Slater potential plus an additional term containing a multiplicative parameter αx (a self-consistently determined orbital functional) times a local response potential that is approximated using standard exchange-energy functionals. Applications of the AASCα functionals to diatomic molecules yield significantly improved total, exchange, and atomization energies that compare quite well, but at a much lower computational cost, with those obtained by the exact orbital-dependent exchange energy treatment [S. Ivanov, S. Hirata, and R. J. Bartlett, Phys. Rev. Lett. 83, 5455 (1999); A. Görling, Phys. Rev. Lett. 83, 5459 (1999)] (in fact, the present results are very close to the Hartree-Fock ones). Moreover, because in the AASCα method the exchange potential tends toward the correct (-1/r) asymptotic behavior, the ionization potentials approximated by the negative of the highest-occupied-orbital energy have a closer agreement with experimental values than those resulting from current approximate density functionals. Finally, we show that in the context of the present method it is possible to introduce some generalizations to the Gritsenko-van Leeuwen-van Lenthe-Baerends model [O. Gritsenko, R. van Leeuwen, E. van Lenthe, and E. J. Baerends, Phys. Rev. A 51, 1944 (1995)].

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

  7. Asymptotic boundary layer method for unstable trajectories: Semiclassics for individual scar wavefunctions

    CERN Document Server

    Vagov, A; Zalipaev, V V

    2009-01-01

    We extend the asymptotic boundary layer (ABL) method, originally developed for stable resonator modes, to the description of individual wavefunctions localized around unstable periodic orbits. The formalism applies to the description of scar states in fully or partially chaotic quantum systems, and also allows for the presence of smooth and sharp potentials, as well as magnetic fields. We argue that the separatrix wave function provides the largest contribution to the scars on a single wave function. This agrees with earlier results on the wave-function asymptotics and on the quantization condition of the scar states. Predictions of the ABL formalism are compared with the exact numerical solution for a strip resonator with a parabolic confinement potential and a magnetic field.

  8. A Comparative Approach to the Solution of the Zabolotskaya-Khokhlov Equation by Iteration Methods

    Directory of Open Access Journals (Sweden)

    Saeed Ahmed

    2016-01-01

    Full Text Available We employed different iteration methods like Homotopy Analysis Method (HAM, Adomian Decomposition Method (ADM, and Variational Iteration Method (VIM to find the approximate solution to the Zabolotskaya-Khokhlov (ZK equation. Iteration methods are used to solve linear and nonlinear PDEs whose classical methods are either very complex or too limited to apply. A comparison study has been made to see which of these methods converges to the approximate solution rapidly. The result revealed that, amongst these methods, ADM is more effective and simpler tool in its nature which does not require any transformation or linearization.

  9. Strong Convergence of an Iterative Method for Equilibrium Problems and Variational Inequality Problems

    Directory of Open Access Journals (Sweden)

    HongYu Li

    2009-01-01

    Full Text Available We introduce an iterative method for finding a common element of the set of solutions of equilibrium problems, the set of solutions of variational inequality problems, and the set of fixed points of finite many nonexpansive mappings. We prove strong convergence of the iterative sequence generated by the proposed iterative algorithm to the unique solution of a variational inequality, which is the optimality condition for the minimization problem.

  10. Variational iteration method for solving partial differential equations with variable coefficients

    Energy Technology Data Exchange (ETDEWEB)

    Ali, A.H.A. [Mathematics Department, Faculty of Science, Menoufia University, Shebein El-Koom (Egypt)], E-mail: ahaali_49@yahoo.com; Raslan, K.R. [Department of Mathematics, Faculty of Science, Al-Azhar University, Nasr-City, Cairo (Egypt)], E-mail: kamal_raslan@yahoo.com

    2009-05-15

    An extremely simple and elementary but rigorous derivation of exact solutions of partial differential equations in different dimensions with variable coefficients is given using the variational iteration method. The efficiency of the considered method is illustrated by some examples. The results show that the proposed iteration technique, without linearization or small perturbation, is very effective and convenient.

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

  12. Iterative method of solving Cauchy problem with reproducing kernel for nonlinear hyperbolic equations

    Institute of Scientific and Technical Information of China (English)

    2001-01-01

    Presents the iterative method of solving Cauchy problem withreproducing kernel for nonlinear hyperbolic equations, and the application of the computational technique of reproducing kernel space to simplify, the iterative computation and increase the convergence rate and points out that this method is still effective. Even if the initial condition is discrete.

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

  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...... be based on a theoretical analysis of the underlying inverse problem....

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

    DEFF Research Database (Denmark)

    Poulsen, Peter Noe; Damkilde, Lars

    1997-01-01

    Application of the Finite Element Method to Koiter's asymptotic postbuckling theory often leads to numerical problems. Generally it is believed that these problems are due to locking of nonlinear terms of different orders. A general method is given here that explains the reason for the numerical...... 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...

  16. Research on the iterative method for model updating based on the frequency response function

    Institute of Scientific and Technical Information of China (English)

    Wei-Ming Li; Jia-Zhen Hong

    2012-01-01

    Model reduction technique is usually employed in model updating process,In this paper,a new model updating method named as cross-model cross-frequency response function (CMCF) method is proposed and a new iterative method associating the model updating method with the model reduction technique is investigated.The new model updating method utilizes the frequency response function to avoid the modal analysis process and it does not need to pair or scale the measured and the analytical frequency response function,which could greatly increase the number of the equations and the updating parameters.Based on the traditional iterative method,a correction term related to the errors resulting from the replacement of the reduction matrix of the experimental model with that of the finite element model is added in the new iterative method.Comparisons between the traditional iterative method and the proposed iterative method are shown by model updating examples of solar panels,and both of these two iterative methods combine the CMCF method and the succession-level approximate reduction technique.Results show the effectiveness of the CMCF method and the proposed iterative method.

  17. A Newton type iterative method for heat-conduction inverse problems

    Institute of Scientific and Technical Information of China (English)

    HE Guo-qiang; MENG Ze-hong

    2007-01-01

    An inverse problem for identification of the coefficient in heat-conduction equation is considered. After reducing the problem to a nonlinear ill-posed operator equation, Newton type iterative methods are considered. The implicit iterative method is applied to the linearized Newton equation, and the key step in the process is that a new reasonable a posteriori stopping rule for the inner iteration is presented. Numerical experiments for the new method as well as for Tikhonov method and Bakushikskii method are given, and these results show the obvious advantages of the new method over the other ones.

  18. On the Convergence for an Iterative Method for Quasivariational Inclusions

    Directory of Open Access Journals (Sweden)

    Wu Changqun

    2010-01-01

    Full Text Available We introduce an iterative algorithm for finding a common element of the set of solutions of quasivariational inclusion problems and of the set of fixed points of strict pseudocontractions in the framework Hilbert spaces. The results presented in this paper improve and extend the corresponding results announced by many others.

  19. Eigensensitivity analysis of rotating clamped uniform beams with the asymptotic numerical method

    Science.gov (United States)

    Bekhoucha, F.; Rechak, S.; Cadou, J. M.

    2016-12-01

    In this paper, free vibrations of a rotating clamped Euler-Bernoulli beams with uniform cross section are studied using continuation method, namely asymptotic numerical method. The governing equations of motion are derived using Lagrange's method. The kinetic and strain energy expression are derived from Rayleigh-Ritz method using a set of hybrid variables and based on a linear deflection assumption. The derived equations are transformed in two eigenvalue problems, where the first is a linear gyroscopic eigenvalue problem and presents the coupled lagging and stretch motions through gyroscopic terms. While the second is standard eigenvalue problem and corresponds to the flapping motion. Those two eigenvalue problems are transformed into two functionals treated by continuation method, the Asymptotic Numerical Method. New method proposed for the solution of the linear gyroscopic system based on an augmented system, which transforms the original problem to a standard form with real symmetric matrices. By using some techniques to resolve these singular problems by the continuation method, evolution curves of the natural frequencies against dimensionless angular velocity are determined. At high angular velocity, some singular points, due to the linear elastic assumption, are computed. Numerical tests of convergence are conducted and the obtained results are compared to the exact values. Results obtained by continuation are compared to those computed with discrete eigenvalue problem.

  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. A Note on Asymptotic Contractions

    Directory of Open Access Journals (Sweden)

    Marina Arav

    2006-12-01

    Full Text Available We provide sufficient conditions for the iterates of an asymptotic contraction on a complete metric space X to converge to its unique fixed point, uniformly on each bounded subset of X.

  2. A Note on Asymptotic Contractions

    Directory of Open Access Journals (Sweden)

    Castillo Santos Francisco Eduardo

    2007-01-01

    Full Text Available We provide sufficient conditions for the iterates of an asymptotic contraction on a complete metric space to converge to its unique fixed point, uniformly on each bounded subset of .

  3. A Variational Iteration Solving Method for a Class of Generalized Boussinesq Equations

    Institute of Scientific and Technical Information of China (English)

    MO Jia-Qi

    2009-01-01

    We study a generalized nonlinear Boussinesq equation by introducing a proper functional and constructing the variational iteration sequence with suitable initial approximation.The approximate solution is obtained for the solitary wave of the Boussinesq equation with the variational iteration method.

  4. The Renormalization-Group Method Applied to Asymptotic Analysis of Vector Fields

    CERN Document Server

    Kunihiro, T

    1996-01-01

    The renormalization group method of Goldenfeld, Oono and their collaborators is applied to asymptotic analysis of vector fields. The method is formulated on the basis of the theory of envelopes, as was done for scalar fields. This formulation actually completes the discussion of the previous work for scalar equations. It is shown in a generic way that the method applied to equations with a bifurcation leads to the Landau-Stuart and the (time-dependent) Ginzburg-Landau equations. It is confirmed that this method is actually a powerful theory for the reduction of the dynamics as the reductive perturbation method is. Some examples for ordinary diferential equations, such as the forced Duffing, the Lotka-Volterra and the Lorenz equations, are worked out in this method: The time evolution of the solution of the Lotka-Volterra equation is explicitly given, while the center manifolds of the Lorenz equation are constructed in a simple way in the RG method.

  5. INTERATIVE APPROXIMATION OF FIXED POINTS FOR ALMOST ASYMPTOTICALLY NONEXPANSIVE TYPE MAPPINGS IN BANACH SPACES

    Institute of Scientific and Technical Information of China (English)

    曾六川

    2003-01-01

    A new class of almost asymptotically nonexpansive type mappings in Banach spaces is introduced, which includes a number of known classes of nonlinear Lipschitzian mappings and non-Lipschitzian mappings in Banach spaces as special cases; for example,the known classes of nonexpansive mappings, asymptotically nonexpansive mappings and asymptotically nonexpansive type mappings. The convergence problem of modified Ishikawa iterative sequences with errors for approximating fixed points of almost asymptotically nonexpansive type mappings is considered. Not only S. S. Chang' s inequality but also H.K. Xu' s one for the norms of Banach spaces are applied to make the error estimate between the exact fixed point and the approximate one. Moreover, Zhang Shi-sheng ' s method (Applied Mathematics and Mechanics ( English Edition ), 2001,22 (1) :25 - 34) for making the convergence analysis of modified Ishikawa iterative sequences with errors is extended to the case of almost asymptotically nonexpansive type mappings. The new convergence criteria of modified Ishikawa iterative sequences with errors for finding fixed points of almost asymptotically nonexpansive type mappings in uniformly convex Banach spaces are presented. Also, the new convergence criteria of modified Mann iterative sequences with errors for this class of mappings are immediately obtained from these criteria. The above results unify, improve and generalize Zhang Shi-sheng's ones on approximating fixed points of asymptotically nonexpansive type mappings by the modified Ishikawa and Mann iterative sequences with errors.

  6. A Local Fractional Variational Iteration Method for Laplace Equation within Local Fractional Operators

    Directory of Open Access Journals (Sweden)

    Yong-Ju Yang

    2013-01-01

    Full Text Available The local fractional variational iteration method for local fractional Laplace equation is investigated in this paper. The operators are described in the sense of local fractional operators. The obtained results reveal that the method is very effective.

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

  8. ITERATIVE MULTICHANNEL BLIND DECONVOLUTION METHOD FOR TEMPORALLY COLORED SOURCES

    Institute of Scientific and Technical Information of China (English)

    Zhang Mingjian; Wei Gang

    2004-01-01

    An iterative separation approach, i.e. source signals are extracted and removed one by one, is proposed for multichannel blind deconvolution of colored signals. Each source signal is extracted in two stages: a filtered version of the source signal is first obtained by solving the generalized eigenvalue problem, which is then followed by a single channel blind deconvolution based on ensemble learning. Simulation demonstrates the capability of the approach to perform efficient mutichannel blind deconvolution.

  9. Drawing Dynamical and Parameters Planes of Iterative Families and Methods

    Directory of Open Access Journals (Sweden)

    Francisco I. Chicharro

    2013-01-01

    Full Text Available The complex dynamical analysis of the parametric fourth-order Kim’s iterative family is made on quadratic polynomials, showing the MATLAB codes generated to draw the fractal images necessary to complete the study. The parameter spaces associated with the free critical points have been analyzed, showing the stable (and unstable regions where the selection of the parameter will provide us the excellent schemes (or dreadful ones.

  10. Drawing dynamical and parameters planes of iterative families and methods.

    Science.gov (United States)

    Chicharro, Francisco I; Cordero, Alicia; Torregrosa, Juan R

    2013-01-01

    The complex dynamical analysis of the parametric fourth-order Kim's iterative family is made on quadratic polynomials, showing the MATLAB codes generated to draw the fractal images necessary to complete the study. The parameter spaces associated with the free critical points have been analyzed, showing the stable (and unstable) regions where the selection of the parameter will provide us the excellent schemes (or dreadful ones).

  11. Asymptotic key generation rates with phase-randomized coherent light by decoy method

    CERN Document Server

    Hayashi, M

    2007-01-01

    The asymptotic key generation (AKG) rates of quantum key distribution (QKD) with the decoy method are discussed in both the forward error correction and the reverse error correction cases when the QKD system is equipped with phase-randomized coherent light with arbitrary number of intensities. For this purpose, we derive a useful convex expansion of the phase-randomized coherent state. We also derive upper bounds of AKG rates on a natural and concrete channel model. Using these upper bounds, we numerically check that the AKG rates are almost saturated when the number of intensities is three.

  12. Solving the Fractional Rosenau-Hyman Equation via Variational Iteration Method and Homotopy Perturbation Method

    Directory of Open Access Journals (Sweden)

    R. Yulita Molliq

    2012-01-01

    Full Text Available In this study, fractional Rosenau-Hynam equations is considered. We implement relatively new analytical techniques, the variational iteration method and the homotopy perturbation method, for solving this equation. The fractional derivatives are described in the Caputo sense. The two methods in applied mathematics can be used as alternative methods for obtaining analytic and approximate solutions for fractional Rosenau-Hynam equations. In these schemes, the solution takes the form of a convergent series with easily computable components. The present methods perform extremely well in terms of efficiency and simplicity.

  13. A convergence analysis of SOR iterative methods for linear systems with weak H-matrices

    Directory of Open Access Journals (Sweden)

    Zhang Cheng-yi

    2016-01-01

    Full Text Available It is well known that SOR iterative methods are convergent for linear systems, whose coefficient matrices are strictly or irreducibly diagonally dominant matrices and strong H-matrices (whose comparison matrices are nonsingular M-matrices. However, the same can not be true in case of those iterative methods for linear systems with weak H-matrices (whose comparison matrices are singular M-matrices. This paper proposes some necessary and sufficient conditions such that SOR iterative methods are convergent for linear systems with weak H-matrices. Furthermore, some numerical examples are given to demonstrate the convergence results obtained in this paper.

  14. Application of asymptotic waveform approximation technique to hybrid FE/BI method for 3D scattering

    Institute of Scientific and Technical Information of China (English)

    PENG Zhen; SHENG XinQing

    2007-01-01

    The asymptotic waveform evaluation (AWE) technique is a rational function approximation method in computational mathematics, which is used in many applications in computational electromagnetics. In this paper, the performance of the AWE technique in conjunction with hybrid finite element/boundary integral (FE/BI) method is firstly investigated. The formulation of the AWE applied in hybrid FE/BI method is given in detail. The characteristic implementation of the application of the AWE to the hybrid FE/BI method is discussed. Numerical results demonstrate that the AWE technique can greatly speed up the hybrid FE/BI method to acquire wide-band and wide-angle backscatter radar-cross-section (RCS) by complex targets.

  15. 渐近拟非扩张型非自映象的修正Ishikawa Reich-Takahashi迭代逼近问题%Iterative approximation problem of modified ishkawa reich-takahashi iterative process for asymptotically quasi-nonexpansive type nonseif-maps

    Institute of Scientific and Technical Information of China (English)

    孟京华; 刘文军

    2011-01-01

    The concept of asymptotically quasi-nonespansive type nonself-maps was introduced. A new modified Ishikawa Re ich-Itakahashi type iterative process for asymptotically quasi-nonespansive type nonself-maps was given. Its strong convergence in uniformly convex Banach space was discussed. Some new results on strong. Convergences of iterative sequence of the fixed point for asymptotically quasi-nonespansive nonself-maps were obtained. These improve and extend some corresponding results in papers [1 -10].%给出渐近拟非扩张型的非自映象定义,并对其引入了一个新的修正的Ishikawa Reich-Takahashi迭代程序.在一致凸Banach空间中讨论了此迭代序列的强收敛性,获得了此迭代序列强收敛到渐近拟非扩张型非自映象的不动点的相关结论.改进和发展了文献[1-10]的相关结果.

  16. Polynomial Asymptotes

    Science.gov (United States)

    Dobbs, David E.

    2010-01-01

    This note develops and implements the theory of polynomial asymptotes to (graphs of) rational functions, as a generalization of the classical topics of horizontal asymptotes and oblique/slant asymptotes. Applications are given to hyperbolic asymptotes. Prerequisites include the division algorithm for polynomials with coefficients in the field of…

  17. PRECONDITIONED GAUSS-SEIDEL TYPE ITERATIVE METHOD FOR SOLVING LINEAR SYSTEMS

    Institute of Scientific and Technical Information of China (English)

    CHENG Guang-hui; HUANG Ting-zhu; CHENG Xiao-yu

    2006-01-01

    The preconditioned Gauss-Seidel type iterative method for solving linear systems, with the proper choice of the preconditioner, is presented. Convergence of the preconditioned method applied to Z-matrices is discussed. Also the optimal parameter is presented. Numerical results show that the proper choice of the preconditioner can lead to effective by the preconditioned Gauss-Seidel type iterative methods for solving linear systems.

  18. Rapid iterative method for electronic-structure eigenproblems using localised basis functions

    Science.gov (United States)

    Rayson, M. J.; Briddon, P. R.

    2008-01-01

    Eigenproblems resulting from the use of localised basis functions (typically Gaussian or Slater type orbitals) in density functional electronic-structure calculations are often solved using direct linear algebra. A full implementation is presented built around an iterative method known as 'residual minimisation—direct inversion of the iterative subspace' (RM-DIIS) to be used to solve many similar eigenproblems in a self-consistency cycle. The method is more efficient than direct methods and exhibits superior scaling on parallel supercomputers.

  19. Application of Variational Iteration Method to Fractional Hyperbolic Partial Differential Equations

    Directory of Open Access Journals (Sweden)

    Fadime Dal

    2009-01-01

    Full Text Available The solution of the fractional hyperbolic partial differential equation is obtained by means of the variational iteration method. Our numerical results are compared with those obtained by the modified Gauss elimination method. Our results reveal that the technique introduced here is very effective, convenient, and quite accurate to one-dimensional fractional hyperbolic partial differential equations. Application of variational iteration technique to this problem has shown the rapid convergence of the sequence constructed by this method to the exact solution.

  20. An iterative interference cancellation based frequency offset estimation method for OFDMA uplink systems

    Institute of Scientific and Technical Information of China (English)

    Zhou En; Wang Wenbo

    2006-01-01

    In this paper, Moose scheme is used for frequency offset estimation in OFDMA uplink systems due to that the signals from different users can be easily distinguished in frequency domain. However, differential multiple access interference (MAI) will deteriorate the frequency offset estimation performances,especially in interleaved OFDMA system. Analysis and simulation results manifest that frequency offset estimation by Moose scheme in block OFDMA system is more robust than that in interleaved OFDMA system. And an iterative interference cancellation method has been proposed to suppress the differential MAI interference for interleaved OFDMA system, in which Moose scheme is the special case of the number of iteration is equal to one. Simulation results demonstrate that the proposed method can improve the performance with the increase of the number of iterations. In consideration of the performance and complexity,the proposed method with two iterations is selected. And the full comparison results of the proposed iterative method with two iterations and that with one iteration (conventional Moose scheme) are given in the paper, which sufficiently demonstrate that the performance gain can be obtained by the interference cancellation operation in interleaved OFDMA system.

  1. IMPROVED HOMOTOPY ITERATION METHOD AND APPLIED TO THE NINE-POINT PATH SYNTHESIS PROBLEM FOR FOUR-BAR LINKAGES

    Institute of Scientific and Technical Information of China (English)

    2000-01-01

    A new algorithm called homotopy iteration method based on the homotopy function is studied and improved. By the improved homotopy iteration method, polynomial systems with high order and deficient can be solved fast and efficiently comparing to the original homotopy iteration method. Numerical examples for the ninepoint path synthesis of four-bar linkages show the advantages and efficiency of the improved homotopy iteration method.

  2. An Approximation to Solution of Space and Time Fractional Telegraph Equations by He's Variational Iteration Method

    Directory of Open Access Journals (Sweden)

    Ali Sevimlican

    2010-01-01

    Full Text Available He's variational iteration method (VIM is used for solving space and time fractional telegraph equations. Numerical examples are presented in this paper. The obtained results show that VIM is effective and convenient.

  3. ASYMPTOTIC STABILITY PROPERTIES OF θ-METHODS FOR THE MULTI-PANTOGRAPH DELAY DIFFERENTIAL EQUATION

    Institute of Scientific and Technical Information of China (English)

    Dong-song Li; Ming-zhu Liu

    2004-01-01

    This paper deals with the asymptotic stability analysis of θ - methods for multi-pantograph delay differential equation u'(t)=λu(t)+lΣi=1μiu(qit),0<ql<ql-1<…<ql<1,/u(0)=u0.Here λ,μ1,…,μl,u0∈C.In recent years stability properties of numerical methods for this kind of equation has been studied by numerous authors. Many papers are concerned with meshes with fixed stepsize. In general the developed techniques give rise to non-ordinary recurrence relation. In this work, instead, we study constrained variable stpesize schemes, suggested by theoretical and computational reasons, which lead to a non-stationary difference equation.A general theorem is presented which can be used to obtain the characterization of the stability regions of θ - methods.

  4. Variational Iteration Method for Singular Perturbation Initial Value Problems with Delays

    Directory of Open Access Journals (Sweden)

    Yongxiang Zhao

    2014-01-01

    Full Text Available The variational iteration method (VIM is applied to solve singular perturbation initial value problems with delays (SPIVPDs. Some convergence results of VIM for solving SPIVPDs are given. The obtained sequence of iterates is based on the use of general Lagrange multipliers; the multipliers in the functionals can be identified by the variational theory. Moreover, the numerical examples show the efficiency of the method.

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

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

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

  8. Evaluation of the Fokker-Planck probability by Asymptotic Taylor Expansion Method

    Science.gov (United States)

    Firat, Kenan; Ozer, Okan

    2017-02-01

    The one-dimensional Fokker-Planck equation is solved by the Asymptotic Taylor Expansion Method for the time-dependent probability density of a particle. Using an ansatz wave function, one obtains the series expansion of the solution for the Schrödinger and it allows one to find out the eigen functions and eigen energies of the states to the evaluation of the probability. The eigen energies of some certain kind of Bistable potentials are calculated for some certain potential parameters. The probability function is determined and graphed for potential parameters. The numerical results are compared with existing literature, and a conclusion about the advantages and disadvantages on the method is given.

  9. Modified Hybrid Block Iterative Algorithm for Convex Feasibility Problems and Generalized Equilibrium Problems for Uniformly Quasi-ϕ-Asymptotically Nonexpansive Mappings

    Directory of Open Access Journals (Sweden)

    Siwaporn Saewan

    2010-01-01

    Full Text Available We introduce a modified block hybrid projection algorithm for solving the convex feasibility problems for an infinite family of closed and uniformly quasi-ϕ-asymptotically nonexpansive mappings and the set of solutions of the generalized equilibrium problems. We obtain a strong convergence theorem for the sequences generated by this process in a uniformly smooth and strictly convex Banach space with Kadec-Klee property. The results presented in this paper improve and extend some recent results.

  10. Intelligent Iterated Local Search Methods for Solving Vehicle Routing Problem with Different Fleets

    Institute of Scientific and Technical Information of China (English)

    2007-01-01

    To solve vehicle routing problem with different fleets, two methodologies are developed. The first methodology adopts twophase strategy. In the first phase, the improved savings method is used to assign customers to appropriate vehicles. In the second phase, the iterated dynasearch algorithm is adopted to route each selected vehicle with the assigned customers. The iterated dynasearch algorithm combines dynasearch algorithm with iterated local search algorithm based on random kicks. The second methodplogy adopts the idea of cyclic transfer which is performed by using dynamic programming algorithm, and the iterated dynasearch algorithm is also embedded in it. The test results show that both methodologies generate better solutions than the traditional method, and the second methodology is superior to the first one.

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

  12. Evaluating user reputation in online rating systems via an iterative group-based ranking method

    CERN Document Server

    Gao, Jian

    2015-01-01

    Reputation is a valuable asset in online social lives and it has drawn increased attention. How to evaluate user reputation in online rating systems is especially significant due to the existence of spamming attacks. To address this issue, so far, a variety of methods have been proposed, including network-based methods, quality-based methods and group-based ranking method. In this paper, we propose an iterative group-based ranking (IGR) method by introducing an iterative reputation-allocation process into the original group-based ranking (GR) method. More specifically, users with higher reputation have higher weights in dominating the corresponding group sizes. The reputation of users and the corresponding group sizes are iteratively updated until they become stable. Results on two real data sets suggest that the proposed IGR method has better performance and its robustness is considerably improved comparing with the original GR method. Our work highlights the positive role of users' grouping behavior towards...

  13. Variational iteration method for solving non-linear partial differential equations

    Energy Technology Data Exchange (ETDEWEB)

    Hemeda, A.A. [Department of Mathematics, Faculty of Science, University of Tanta, Tanta (Egypt)], E-mail: aahemeda@yahoo.com

    2009-02-15

    In this paper, we shall use the variational iteration method to solve some problems of non-linear partial differential equations (PDEs) such as the combined KdV-MKdV equation and Camassa-Holm equation. The variational iteration method is superior than the other non-linear methods, such as the perturbation methods where this method does not depend on small parameters, such that it can fined wide application in non-linear problems without linearization or small perturbation. In this method, the problems are initially approximated with possible unknowns, then a correction functional is constructed by a general Lagrange multiplier, which can be identified optimally via the variational theory.

  14. CONVERGENCE OF PARALLEL DIAGONAL ITERATION OF RUNGE-KUTTA METHODS FOR DELAY DIFFERENTIAL EQUATIONS

    Institute of Scientific and Technical Information of China (English)

    Xiao-hua Ding; Mingzhu Liu

    2004-01-01

    Implicit Runge-Kutta method is highly accurate and stable for stiff initial value prob-lem. But the iteration technique used to solve implicit Runge-Kutta method requires lots of computational efforts. In this paper, we extend the Parallel Diagonal Iterated Runge-Kutta(PDIRK) methods to delay differential equations(DDEs). We give the convergence region of PDIRK methods, and analyze the speed of convergence in three parts for the P-stability region of the Runge-Kutta corrector method. Finally, we analysis the speed-up factor through a numerical experiment. The results show that the PDIRK methods to DDEs are efficient.

  15. Three-step iterative methods with eighth-order convergence for solving nonlinear equations

    Directory of Open Access Journals (Sweden)

    Mashallah Matinfar

    2013-01-01

    Full Text Available A family of eighth-order iterative methods for solution of nonlinear equations is presented. We propose an optimal three-step method with eight-order convergence for finding the simple roots of nonlinear equations by Hermite interpolation method. Per iteration of this method requires two evaluations of the function and two evaluations of its first derivative, which implies that the efficiency index of the developed methods is 1.682. Some numerical examples illustrate that the algorithms are more efficient and performs better than the other methods.

  16. Asymptotic Method and Numerical Analysis for Self-Excited Vibration in Rolling Mill with Clearance

    Directory of Open Access Journals (Sweden)

    Hongguang Li

    2001-01-01

    Full Text Available In this paper, a dynamic model is proposed for analysis of nonlinear vibrations of rolling mills with fixed and time-varying clearances. Self-excited vibrations of the system that is basically involved with piece-wise nonlinearity and discontinuities are investigated via asymptotic method. It is shown by numerical results obtained for the nonlinear system with a time-varying clearance that different forms of nonlinear vibrations appear to be periodic, quasi-periodic and chaotic. Influence of the system parameters on the nonlinear vibration behaviors is examined by applying the Poincare sections, the bifurcation diagram and the largest Lyapunov exponent. New phenomena are observed in nonlinear motions of the rolling mill mechanism and are of significant importance for design of this type of mechanical systems.

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

  18. Existence and Blowup Results for Asymptotically Euclidean Initial Data Sets Generated by the Conformal Method

    CERN Document Server

    Dilts, James

    2016-01-01

    For each set of (freely chosen) seed data, the conformal method reduces the Einstein constraint equations to a system of elliptic equations, the conformal constraint equations. We prove an admissibility criterion, based on a (conformal) prescribed scalar curvature problem, which provides a necessary condition on the seed data for the conformal constraint equations to (possibly) admit a solution. We then consider sets of asymptotically Euclidean (AE) seed data for which solutions of the conformal constraint equations exist, and examine the blowup properties of these solutions as the seed data sets approach sets for which no solutions exist. We also prove that there are AE seed data sets which include a Yamabe nonpositive metric and lead to solutions of the conformal constraints. These data sets allow the mean curvature function to have zeroes.

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

    CERN Document Server

    Marinca, Vasile; Bereteu, Liviu

    2015-01-01

    Magnetorheological fluids (MR) are stable suspensions of magnetizable microparticles, characterized by the property to change the rheological characteristics when subjected to the action of magnetic field. Together with another class of materials that change their rheological characteristics in the presence of an electric field, called electrorheological materials are known in the literature as the smart materials or controlled materials. In the absence of a magnetic field the particles in MR fluid are dispersed in the base fluid and its flow through the apertures is behaves as a Newtonian fluid having a constant shear stress. When the magnetic field is applying a MR fluid behavior change, and behaves like a Bingham fluid with a variable shear stress. Dynamic response time is an important characteristic for determining the performance of MR dampers in practical civil engineering applications. The purpose of this paper is to show how to use the Optimal Homotopy Asymptotic Method (OHAM) to solve the nonlinear d...

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

  1. Banach空间中渐近非扩张映象的Reich型均值迭代的强收敛性%Strong Convergence of Reich Mean Iterations for Asymptotically Nonexpansive Mappings in Banach Spaces

    Institute of Scientific and Technical Information of China (English)

    王雄瑞

    2011-01-01

    In this paper, the author gives some convergence theorems of the sufficient and necessary conditions in determining the convergence of Reich type mean iteration for asymptotically nonexpansive mapping in Banach spaces, such as Hilbert spaces, and some implicit conditions of recent relative papers are deleted.%利用粘性逼近法在Hilbert空间以及lp(1<p≤2)等空间中给出了判定渐近非扩张非自射映象的Reich均值迭代强收敛的充要条件,并去掉了最近相关文献中的一些复杂条件.

  2. A generalized Jacobi-Davidson iteration method for linear eigenvalue problems

    NARCIS (Netherlands)

    Sleijpen, G.L.G.; Vorst, H.A. van der

    1998-01-01

    In this paper we propose a new method for the iterative computation of a few of the extremal eigenvalues of a symmetric matrix and their associated eigenvectors. The method is based on an old and almost unknown method of Jacobi. Jacobi's approach, combined with Davidson's method, leads to a new meth

  3. Advancements and performance of iterative methods in industrial applications codes on CRAY parallel/vector supercomputers

    Energy Technology Data Exchange (ETDEWEB)

    Poole, G.; Heroux, M. [Engineering Applications Group, Eagan, MN (United States)

    1994-12-31

    This paper will focus on recent work in two widely used industrial applications codes with iterative methods. The ANSYS program, a general purpose finite element code widely used in structural analysis applications, has now added an iterative solver option. Some results are given from real applications comparing performance with the tradition parallel/vector frontal solver used in ANSYS. Discussion of the applicability of iterative solvers as a general purpose solver will include the topics of robustness, as well as memory requirements and CPU performance. The FIDAP program is a widely used CFD code which uses iterative solvers routinely. A brief description of preconditioners used and some performance enhancements for CRAY parallel/vector systems is given. The solution of large-scale applications in structures and CFD includes examples from industry problems solved on CRAY systems.

  4. STRONG CONVERGENCE OF MONOTONE HYBRID METHOD FOR FIXED POINT ITERATION PROCESSES

    Institute of Scientific and Technical Information of China (English)

    Yongfu SU; Xiaolong QIN

    2008-01-01

    K. Nakajo and W. Takahashi in 2003 proved the strong convergence theorems for nonexpansive mappings, nonexpansive semigroups, and proximal point algorithm for zero point of monotone operators in Hilbert spaces by using the hybrid method in mathematical programming. The purpose of this paper is to modify the hybrid iteration method of K. Nakajo and W. Takahashi through the monotone hybrid method, and to prove strong convergence theorems. The convergence rate of iteration process of the monotone hybrid method is faster than that of the iteration process of the hybrid method of K. Nakajo and W. Takahashi. In the proofs in this article, Cauchy sequence method is used to avoid the use of the demiclosedness principle and Opial's condition.

  5. An efficient iterative method for solving the Fokker-Planck equation

    Science.gov (United States)

    AL-Jawary, M. A.

    In the present paper, the new iterative method proposed by Daftardar-Gejji and Jafari (NIM or DJM) (2006) is used to solve the linear and nonlinear Fokker-Planck equations and some similar equations. In this iterative method the solution is obtained in the series form that converge to the exact solution with easily computed components. The results demonstrate that the method has many merits such as being derivative-free, overcome the difficulty arising in calculating Adomian polynomials to handle the nonlinear terms in Adomian decomposition method (ADM). It does not require to calculate Lagrange multiplier as in variational iteration method (VIM) and for solving a nonlinear case, the terms of the sequence become complex after several iterations. Thus, analytical evaluation of terms becomes very difficult or impossible in VIM. No needs to construct a homotopy and solve the corresponding algebraic equations as in homotopy perturbation method (HPM). In this work, the applications of the DJM for 1D, 2D, 3D linear and nonlinear Fokker-Planck equations are given and the results demonstrate that the presented method is very effective and reliable and does not require any restrictive assumptions for nonlinear terms and provide the analytic solutions. A symbolic manipulator Mathematica® 10.0 was used to evaluate terms in the iterative process.

  6. Nonequilibrium hypersonic flows simulations with asymptotic-preserving Monte Carlo methods

    Science.gov (United States)

    Ren, Wei; Liu, Hong; Jin, Shi

    2014-12-01

    In the rarefied gas dynamics, the DSMC method is one of the most popular numerical tools. It performs satisfactorily in simulating hypersonic flows surrounding re-entry vehicles and micro-/nano- flows. However, the computational cost is expensive, especially when Kn → 0. Even for flows in the near-continuum regime, pure DSMC simulations require a number of computational efforts for most cases. Albeit several DSMC/NS hybrid methods are proposed to deal with this, those methods still suffer from the boundary treatment, which may cause nonphysical solutions. Filbet and Jin [1] proposed a framework of new numerical methods of Boltzmann equation, called asymptotic preserving schemes, whose computational costs are affordable as Kn → 0. Recently, Ren et al. [2] realized the AP schemes with Monte Carlo methods (AP-DSMC), which have better performance than counterpart methods. In this paper, AP-DSMC is applied in simulating nonequilibrium hypersonic flows. Several numerical results are computed and analyzed to study the efficiency and capability of capturing complicated flow characteristics.

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

  8. 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...... (IR) MAD method in a series of iterations places increasing focus on “difficult” observations, here observations whose change status over time is uncertain. The MAD method is based on the established technique of canonical correlation analysis: for the multivariate data acquired at two points in time...

  9. Complex seismic wavefi eld interpolation based on the Bregman iteration method in the sparse transform domain

    Institute of Scientific and Technical Information of China (English)

    Gou Fu-Yan; Liu Cai; Liu Yang; Feng Xuan; Cui Fang-Zi

    2014-01-01

    In seismic prospecting,fi eld conditions and other factors hamper the recording of the complete seismic wavefi eld; thus, data interpolation is critical in seismic data processing. Especially, in complex conditions, prestack missing data affect the subsequent high-precision data processing workfl ow. Compressive sensing is an effective strategy for seismic data interpolation by optimally representing the complex seismic wavefi eld and using fast and accurate iterative algorithms. The seislet transform is a sparse multiscale transform well suited for representing the seismic wavefield, as it can effectively compress seismic events. Furthermore, the Bregman iterative algorithm is an efficient algorithm for sparse representation in compressive sensing. Seismic data interpolation methods can be developed by combining seismic dynamic prediction, image transform, and compressive sensing. In this study, we link seismic data interpolation and constrained optimization. We selected the OC-seislet sparse transform to represent complex wavefields and used the Bregman iteration method to solve the hybrid norm inverse problem under the compressed sensing framework. In addition, we used an H-curve method to choose the threshold parameter in the Bregman iteration method. Thus, we achieved fast and accurate reconstruction of the seismic wavefi eld. Model andfi eld data tests demonstrate that the Bregman iteration method based on the H-curve norm in the sparse transform domain can effectively reconstruct missing complex wavefi eld data.

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

  11. ESTIMATION METHOD FOR SOLUTIONS TO GENERAL LINEAR SYSTEM OF VOLTERRAINTEGRAL INEQUALITIES INVOLVING ITERATED INTEGRAL FUNCTIONALS

    Institute of Scientific and Technical Information of China (English)

    MA Qinghua; YANG Enhao

    2000-01-01

    An estimation method for solutions to the general linear system of Volterratype integral inequalities containing several iterated integral functionals is obtained. This method is based on a result proved by the present second author in Journ. Math. Anal. Appl.(1984). A certain two-dimensional system of nonlinear ordinary differential equations is also discussed to demonstrate the usefulness of our method.

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

  13. Homotopy Iteration Algorithm for Crack Parameters Identification with Composite Element Method

    Directory of Open Access Journals (Sweden)

    Ling Huang

    2013-01-01

    Full Text Available An approach based on homotopy iteration algorithm is proposed to identify the crack parameters in beam structures. In the forward problem, a fully open crack model with the composite element method is employed for the vibration analysis. The dynamic responses of the cracked beam in time domain are obtained from the Newmark direct integration method. In the inverse analysis, an identification approach based on homotopy iteration algorithm is studied to identify the location and the depth of a cracked beam. The identification equation is derived by minimizing the error between the calculated acceleration response and the simulated measured one. Newton iterative method with the homotopy equation is employed to track the correct path and improve the convergence of the crack parameters. Two numerical examples are conducted to illustrate the correctness and efficiency of the proposed method. And the effects of the influencing parameters, such as measurement time duration, measurement points, division of the homotopy parameter and measurement noise, are studied.

  14. A CLASS OF LDPC CODE'S CONSTRUCTION BASED ON AN ITERATIVE RANDOM METHOD

    Institute of Scientific and Technical Information of China (English)

    Huang Zhonghu; Shen Lianfeng

    2006-01-01

    This letter gives a random construction for Low Density Parity Check (LDPC) codes, which uses an iterative algorithm to avoid short cycles in the Tanner graph. The construction method has great flexible choice in LDPC code's parameters including codelength, code rate, the least girth of the graph, the weight of column and row in the parity check matrix. The method can be applied to the irregular LDPC codes and strict regular LDPC codes. Systemic codes have many applications in digital communication, so this letter proposes a construction of the generator matrix of systemic LDPC codes from the parity check matrix. Simulations show that the method performs well with iterative decoding.

  15. Second degree generalized Jacobi iteration method for solving system of linear equations

    Directory of Open Access Journals (Sweden)

    Tesfaye Kebede Enyew

    2016-05-01

    Full Text Available In this paper, a Second degree generalized Jacobi Iteration method for solving system of linear equations, $Ax=b$ and discuss about the optimal values $a_{1}$ and $b_{1}$ in terms of spectral radius about for the convergence of SDGJ method of $x^{(n+1}=b_{1}[D_{m}^{-1}(L_{m}+U_{m}x^{(n}+k_{1m}]-a_{1}x^{(n-1}.$ Few numerical examples are considered to show that the effective of the Second degree Generalized Jacobi Iteration method (SDGJ in comparison with FDJ, FDGJ, SDJ.

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

  17. Modified Fractional Variational Iteration Method for Solving the Generalized Time-Space Fractional Schrödinger Equation

    Directory of Open Access Journals (Sweden)

    Baojian Hong

    2014-01-01

    Full Text Available Based on He’s variational iteration method idea, we modified the fractional variational iteration method and applied it to construct some approximate solutions of the generalized time-space fractional Schrödinger equation (GFNLS. The fractional derivatives are described in the sense of Caputo. With the help of symbolic computation, some approximate solutions and their iterative structure of the GFNLS are investigated. Furthermore, the approximate iterative series and numerical results show that the modified fractional variational iteration method is powerful, reliable, and effective when compared with some classic traditional methods such as homotopy analysis method, homotopy perturbation method, adomian decomposition method, and variational iteration method in searching for approximate solutions of the Schrödinger equations.

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

  19. DIRECT ITERATIVE METHODS FOR RANK DEFICIENT GENERALIZED LEAST SQUARES PROBLEMS

    Institute of Scientific and Technical Information of China (English)

    Jin-yun Yuan; Xiao-qing Jin

    2000-01-01

    The generalized least squares (LS) problem appears in many application areas. Here W is an m × m symmetric positive definite matrix and A is an m × n matrix with m≥n. Since the problem has many solutions in rank deficient case, some special preconditioned techniques are adapted to obtain the minimum 2-norm solution. A block SOR method and the preconditioned conjugate gradient (PCG) method are proposed here. Convergence and optimal relaxation parameter for the block SOR method are studied. An error bound for the PCG method is given. The comparison of these methods is investigated. Some remarks on the implementation of the methods and the operation cost are given as well.

  20. BLOCK ITERATIVE METHODS FOR LINEAR ALGEBRAIC EQUATION AND DOMAIN DECOMPOSITION METHOD FOR INCOMPRESSIBLE VISCOUS FLOW

    Institute of Scientific and Technical Information of China (English)

    2002-01-01

    It was proved numerically that the Domain Decomposition Method (DDM) with one layer overlapping grids is identical to the block iterative method of linear algebra equations. The results obtained using DDM could be in reasonable aggeement with the results of full-domain simulation. With the three dimensional solver developed by the authors, the flow field in a pipe was simulated using the full-domain DDM with one layer overlapping grids and with patched grids respectively. Both of the two cases led to the convergent solution. Further research shows the superiority of the DDM with one layer overlapping grids to the DDM with patched grids. A comparison between the numerical results obtained by the authors and the experimental results given by Enayet[3] shows that the numerical results are reasonable.

  1. On iterative methods for the incompressible Stokes problem

    NARCIS (Netherlands)

    Rehman, M. ur; Geenen, T.; Vuik, C.; Segal, G.; MacLachlan, S.P.

    2011-01-01

    In this paper, we discuss various techniques for solving the system of linear equations that arise from the discretization of the incompressible Stokes equations by the finite-element method. The proposed solution methods, based on a suitable approximation of the Schur-complement matrix, are shown t

  2. Efficient Inversion in Underwater Acoustics with Analytic, Iterative and Sequential Bayesian Methods

    Science.gov (United States)

    2015-09-30

    Iterative and Sequential Bayesian Methods Zoi-Heleni Michalopoulou Department of Mathematical Sciences New Jersey Institute of Technology...exploiting (fully or partially) the physics of the propagation medium. Algorithms are designed for inversion via the extraction of features of the...statistical modeling. • Develop methods for passive localization and inversion of environmental parameters that select features of propagation that are

  3. Convergence of TTS Iterative Method for Non-Hermitian Positive Definite Linear Systems

    Directory of Open Access Journals (Sweden)

    Cheng-Yi Zhang

    2014-01-01

    Full Text Available The TTS iterative method is proposed to solve non-Hermitian positive definite linear systems and some convergence conditions are presented. Subsequently, these convergence conditions are applied to the ALUS method proposed by Xiang et al. in 2012 and comparison of some convergence theorems is made. Furthermore, an example is given to demonstrate the results obtained in this paper.

  4. On a modification of minimal iteration methods for solving systems of linear algebraic equations

    Science.gov (United States)

    Yukhno, L. F.

    2010-04-01

    Modifications of certain minimal iteration methods for solving systems of linear algebraic equations are proposed and examined. The modified methods are shown to be superior to the original versions with respect to the round-off error accumulation, which makes them applicable to solving ill-conditioned problems. Numerical results demonstrating the efficiency of the proposed modifications are given.

  5. Modified variational iteration method for an El Ni(n)o Southern Oscillation delayed oscillator

    Institute of Scientific and Technical Information of China (English)

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

    2012-01-01

    This paper studies a delayed air-sea coupled oscillator describing the physical mechanism of El Ni(n)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.

  6. Variational iteration method for solving the time-fractional diffusion equations in porous medium

    Institute of Scientific and Technical Information of China (English)

    Wu Guo-Cheng

    2012-01-01

    The variational iteration method is successfully extended to the case of solving fractional differential equations,and the Lagrange multiplier of the method is identified in a more accurate way.Some diffusion models with fractional derivatives are investigated analytically,and the results show the efficiency of the new Lagrange multiplier for fractional differential equations of arbitrary order.

  7. Iterative methods for the WLS state estimation on RISC, vector, and parallel computers

    Energy Technology Data Exchange (ETDEWEB)

    Nieplocha, J. [Pacific Northwest Lab., Richland, WA (United States); Carroll, C.C. [Alabama Univ., University, AL (United States)

    1993-10-01

    We investigate the suitability and effectiveness of iterative methods for solving the weighted-least-square (WLS) state estimation problem on RISC, vector, and parallel processors. Several of the most popular iterative methods are tested and evaluated. The best performing preconditioned conjugate gradient (PCG) is very well suited for vector and parallel processing as is demonstrated for the WLS state estimation of the IEEE standard test systems. A new sparse matrix format for the gain matrix improves vector performance of the PCG algorithm and makes it competitive to the direct solver. Internal parallelism in RISC processors, used in current multiprocessor systems, can be taken advantage of in an implementation of this algorithm.

  8. Improved Reconstruction Quality of Bioluminescent Images by Combining SP3 Equations and Bregman Iteration Method

    Directory of Open Access Journals (Sweden)

    Qiang Wu

    2013-01-01

    Full Text Available Bioluminescence tomography (BLT has a great potential to provide a powerful tool for tumor detection, monitoring tumor therapy progress, and drug development; developing new reconstruction algorithms will advance the technique to practical applications. In the paper, we propose a BLT reconstruction algorithm by combining SP3 equations and Bregman iteration method to improve the quality of reconstructed sources. The numerical results for homogeneous and heterogeneous phantoms are very encouraging and give significant improvement over the algorithms without the use of SP3 equations and Bregman iteration method.

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

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

  11. Three-Step Iterative Methods with Sixth-Order Convergence for Solving Nonlinear Equations

    Directory of Open Access Journals (Sweden)

    Behzad GHANBARI

    2012-09-01

    Full Text Available In this paper, we develop new families of sixth-order methods for solving simple zeros of non-linear equations. These methods are constructed such that the convergence is of order six. Each member of the families requires two evaluations of the given function and two of its derivative per iteration. These methods have more advantages than Newton’s method and other methods with the same convergence order, as shown in the illustration examples.  

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

  13. Convergence of GAOR Iterative Method with Strictly Diagonally Dominant Matrices

    Directory of Open Access Journals (Sweden)

    Guangbin Wang

    2011-01-01

    Full Text Available We discuss the convergence of GAOR method for linear systems with strictly diagonally dominant matrices. Moreover, we show that our results are better than ones of Darvishi and Hessari (2006, Tian et al. (2008 by using three numerical examples.

  14. Reliable iterative methods for solving ill-conditioned algebraic systems

    NARCIS (Netherlands)

    Padiy, Alexander

    2000-01-01

    The finite element method is one of the most popular techniques for numerical solution of partial differential equations. The rapid performance increase of modern computer systems makes it possible to tackle increasingly more difficult finite-element models arising in engineering practice. However,

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

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

    Energy Technology Data Exchange (ETDEWEB)

    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.

  17. A Comparison of Fast Marching, Fast Sweeping and Fast Iterative Methods for the Solution of the Eikonal Equation

    Directory of Open Access Journals (Sweden)

    A. Capozzoli

    2014-11-01

    Full Text Available We compare the computational performance of the Fast Marching Method, the Fast Sweeping Method and the Fast Iterative Method to determine a numerical solution to the eikonal equation. We point out how the Fast Iterative Method outperforms the other two thanks to its parallel processing capabilities.

  18. New version of Optimal Homotopy Asymptotic Method for the solution of nonlinear boundary value problems in finite and infinite intervals

    Directory of Open Access Journals (Sweden)

    Liaqat Ali

    2016-09-01

    Full Text Available In this research work a new version of Optimal Homotopy Asymptotic Method is applied to solve nonlinear boundary value problems (BVPs in finite and infinite intervals. It comprises of initial guess, auxiliary functions (containing unknown convergence controlling parameters and a homotopy. The said method is applied to solve nonlinear Riccati equations and nonlinear BVP of order two for thin film flow of a third grade fluid on a moving belt. It is also used to solve nonlinear BVP of order three achieved by Mostafa et al. for Hydro-magnetic boundary layer and micro-polar fluid flow over a stretching surface embedded in a non-Darcian porous medium with radiation. The obtained results are compared with the existing results of Runge-Kutta (RK-4 and Optimal Homotopy Asymptotic Method (OHAM-1. The outcomes achieved by this method are in excellent concurrence with the exact solution and hence it is proved that this method is easy and effective.

  19. Subspace Iteration and Immersed Interface Methods: Theory, Algorithm, and Applications

    Science.gov (United States)

    2010-08-20

    solution via alevel set fun tion. The new approa hes provide a se ond order dis retedelta fun tion for ellipti and elasti interfa e problems. The...domains [10℄with appli ation to ow past xed obsta les. In the appli ation to problems in mathemati al biology , our immersed-interfa e/level set method...applied to the biologi al problem of for es reating bran hing morphogenesis shows that ontra tility of the mes-en hyme is indeed suÆ ient to reate a

  20. Numerical radiative transfer with state-of-the-art iterative methods made easy

    CERN Document Server

    Lambert, J; Josselin, E; Glorian, J -M

    2015-01-01

    This article presents an on-line tool (rttools.irap.omp.eu) and its accompanying software ressources for the numerical solution of basic radiation transfer out of local thermodynamic equilibrium (LTE). State-of-the-art stationary iterative methods such as Accelerated $\\Lambda$-Iteration and Gauss-Seidel schemes, using a short characteristics-based formal solver are used. We also comment on typical numerical experiments associated to the basic non-LTE radiation problem. These ressources are intended for the largest use and benefit, in support to more classical radiation transfer lectures usually given at the Master level.

  1. 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...... an adversary. 2TBSGs form an intriguing class of games whose status in many ways resembles that of linear programming 40 years ago. They can be solved efficiently with strategy iteration algorithms, resembling the simplex method for linear programming, but no polynomial time algorithm is known. Linear...

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

  3. PARALLEL DYNAMIC ITERATION METHODS FOR SOLVING NONLINEAR TIME-PERIODIC DIFFERENTIAL-ALGEBRAIC EQUATIONS

    Institute of Scientific and Technical Information of China (English)

    Yao-lin Jiang

    2003-01-01

    In this paper we presented a convergence condition of parallel dynamic iteration methods for a nonlinear system of differential-algebraic equations with a periodic constraint.The convergence criterion is decided by the spectral expression of a linear operator derivedfrom system partitions. Numerical experiments given here confirm the theoretical work ofthe paper.

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

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

    NARCIS (Netherlands)

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

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

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

    NARCIS (Netherlands)

    Avrachenkov, K.; Litvak, N.; 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 ab

  7. New iterative method for fractional gas dynamics and coupled Burger's equations.

    Science.gov (United States)

    Al-Luhaibi, Mohamed S

    2015-01-01

    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.

  8. A unified treatment of some perturbed fixed point iterative methods with an infinite pool of operators

    Science.gov (United States)

    Nikazad, Touraj; Abbasi, Mokhtar

    2017-04-01

    In this paper, we introduce a subclass of strictly quasi-nonexpansive operators which consists of well-known operators as paracontracting operators (e.g., strictly nonexpansive operators, metric projections, Newton and gradient operators), subgradient projections, a useful part of cutter operators, strictly relaxed cutter operators and locally strongly Féjer operators. The members of this subclass, which can be discontinuous, may be employed by fixed point iteration methods; in particular, iterative methods used in convex feasibility problems. The closedness of this subclass, with respect to composition and convex combination of operators, makes it useful and remarkable. Another advantage with members of this subclass is the possibility to adapt them to handle convex constraints. We give convergence result, under mild conditions, for a perturbation resilient iterative method which is based on an infinite pool of operators in this subclass. The perturbation resilient iterative methods are relevant and important for their possible use in the framework of the recently developed superiorization methodology for constrained minimization problems. To assess the convergence result, the class of operators and the assumed conditions, we illustrate some extensions of existence research works and some new results.

  9. On the minimal speed and asymptotics of the wave solutions for the lotka volterra system

    CERN Document Server

    Hou, Xiaojie

    2010-01-01

    e study the minimal wave speed and the asymptotics of the traveling wave solutions of a competitive Lotka Volterra system. The existence of the traveling wave solutions is derived by monotone iteration. The asymptotic behaviors of the wave solutions are derived by comparison argument and the exponential dichotomy, which seems to be the key to understand the geometry and the stability of the wave solutions. Also the uniqueness and the monotonicity of the waves are investigated via a generalized sliding domain method.

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

  11. GPGCD, an Iterative Method for Calculating Approximate GCD of Univariate Polynomials, with the Complex Coefficients

    CERN Document Server

    Terui, Akira

    2010-01-01

    We present an extension of our GPGCD method, an iterative method for calculating approximate greatest common divisor (GCD) of univariate polynomials, to polynomials with the complex coefficients. For a given pair of polynomials and a degree, our algorithm finds a pair of polynomials which has a GCD of the given degree and whose coefficients are perturbed from those in the original inputs, making the perturbations as small as possible, along with the GCD. In our GPGCD method, the problem of approximate GCD is transfered to a constrained minimization problem, then solved with a so-called modified Newton method, which is a generalization of the gradient-projection method, by searching the solution iteratively. While our original method is designed for polynomials with the real coefficients, we extend it to accept polynomials with the complex coefficients in this paper.

  12. GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials

    CERN Document Server

    Terui, Akira

    2010-01-01

    We present an extension of our GPGCD method, an iterative method for calculating approximate greatest common divisor (GCD) of univariate polynomials, to multiple polynomial inputs. For a given pair of polynomials and a degree, our algorithm finds a pair of polynomials which has a GCD of the given degree and whose coefficients are perturbed from those in the original inputs, making the perturbations as small as possible, along with the GCD. In our GPGCD method, the problem of approximate GCD is transferred to a constrained minimization problem, then solved with the so-called modified Newton method, which is a generalization of the gradient-projection method, by searching the solution iteratively. In this paper, we extend our method to accept more than two polynomials with the real coefficients as an input.

  13. GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials

    Science.gov (United States)

    Terui, Akira

    We present an extension of our GPGCD method, an iterative method for calculating approximate greatest common divisor (GCD) of univariate polynomials, to multiple polynomial inputs. For a given pair of polynomials and a degree, our algorithm finds a pair of polynomials which has a GCD of the given degree and whose coefficients are perturbed from those in the original inputs, making the perturbations as small as possible, along with the GCD. In our GPGCD method, the problem of approximate GCD is transferred to a constrained minimization problem, then solved with the so-called modified Newton method, which is a generalization of the gradient-projection method, by searching the solution iteratively. In this paper, we extend our method to accept more than two polynomials with the real coefficients as an input.

  14. Variational iteration solving method for El Nino phenomenon atmospheric physics of nonlinear model

    Institute of Scientific and Technical Information of China (English)

    2005-01-01

    A class of El Nino atmospheric physics oscillation model is considered. The El Nino atmospheric physics oscillation is an abnormal phenomenon involved in the tropical Pacific ocean-atmosphere interactions. The conceptual oscillator model should consider the variations of both the eastern and westem Pacific anomaly patterns. An El Nino atmospheric physics model is proposed using a method for the variational iteration theory. Using the variational iteration method, the approximate expansions of the solution of corresponding problem are constructed. That is, firstly, introducing a set of functional and accounting their variationals, the Lagrange multiplicators are counted, and then the variational iteration is defined, finally, the approximate solution is obtained. From approximate expansions of the solution, the zonal sea surface temperature anomaly in the equatorial eastern Pacific and the thermocline depth anomaly of the seaair oscillation for El Nino atmospheric physics model can be analyzed. El Nino is a very complicated natural phenomenon. Hence basic models need to be reduced for the sea-air oscillator and are solved. The variational iteration is a simple and valid approximate method.

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

  16. Variational Iteration Method for the Magnetohydrodynamic Flow over a Nonlinear Stretching Sheet

    Directory of Open Access Journals (Sweden)

    Lan Xu

    2013-01-01

    Full Text Available The variational iteration method (VIM is applied to solve the boundary layer problem of magnetohydrodynamic flow over a nonlinear stretching sheet. The combination of the VIM and the Padé approximants is shown to be a powerful method for solving two-point boundary value problems consisting of systems of nonlinear differential equations. And the comparison of the obtained results with other available results shows that the method is very effective and convenient for solving boundary layer problems.

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

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

  19. Imaging of dielectric objects buried under a rough surface via distorted born iterative method

    Energy Technology Data Exchange (ETDEWEB)

    Altuncu, Y [Nigde University, Electrical and Electronic Engineering Department, Nigde (Turkey); Akleman, F; Semerci, O; Ozlem, C [Istanbul Technical University, Electrical and Electronic Faculty, Maslak-Istanbul (Turkey)], E-mail: altuncuy@itu.edu.tr

    2008-11-01

    A method is given for the shape, permittivity and conductivity reconstruction of lossy dielectric objects buried under rough surfaces using the Distorted Born Iterative Method (DBIM). The method is based on the refreshing of the Green's function of the two-part space media with rough interface by updating the complex permittivity of the reconstruction domain at each iteration step. The scattered field data are measured at multiple locations for multiple transmitters operating at a single frequency where both transmitters and receivers are located above the rough surface interface. The Green's function of the problem is obtained by using the buried object approach (BOA) method where the fluctuations of the rough surface from the flat one are assumed to be buried objects in a two-part space with planar interface. The performance of the method is tested by some numerical applications and satisfactory results are obtained.

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

  1. Multigrid iterative method with adaptive spatial support for computed tomography reconstruction from few-view data

    Science.gov (United States)

    Lee, Ping-Chang

    2014-03-01

    Computed tomography (CT) plays a key role in modern medical system, whether it be for diagnosis or therapy. As an increased risk of cancer development is associated with exposure to radiation, reducing radiation exposure in CT becomes an essential issue. Based on the compressive sensing (CS) theory, iterative based method with total variation (TV) minimization is proven to be a powerful framework for few-view tomographic image reconstruction. Multigrid method is an iterative method for solving both linear and nonlinear systems, especially when the system contains a huge number of components. In medical imaging, image background is often defined by zero intensity, thus attaining spatial support of the image, which is helpful for iterative reconstruction. In the proposed method, the image support is not considered as a priori knowledge. Rather, it evolves during the reconstruction process. Based on the CS framework, we proposed a multigrid method with adaptive spatial support constraint. The simultaneous algebraic reconstruction (SART) with TV minimization is implemented for comparison purpose. The numerical result shows: 1. Multigrid method has better performance while less than 60 views of projection data were used, 2. Spatial support highly improves the CS reconstruction, and 3. When few views of projection data were measured, our method performs better than the SART+TV method with spatial support constraint.

  2. An application of proof mining to nonlinear iterations

    OpenAIRE

    Leustean, Laurentiu

    2012-01-01

    In this paper we apply methods of proof mining to obtain a highly uniform effective rate of asymptotic regularity for the Ishikawa iteration associated to nonexpansive self-mappings of convex subsets of a class of uniformly convex geodesic spaces. Moreover, we show that these results are guaranteed by a combination of logical metatheorems for classical and semi-intuitionistic systems.

  3. AN ITERATIVE HYBRIDIZED MIXED FINITE ELEMENT METHOD FOR ELLIPTIC INTERFACE PROBLEMS WITH STRONGLY DISCONTINUOUS COEFFICIENTS

    Institute of Scientific and Technical Information of China (English)

    Dao-qi Yang; Jennifer Zhao

    2003-01-01

    An iterative algorithm is proposed and analyzed based on a hybridized mixed finite element method for numerically solving two-phase generalized Stefan interface problems withstrongly discontinuous solutions, conormal derivatives, and coefficients. This algorithmiteratively solves small problems for each single phase with good accuracy and exchangeinformation at the interface to advance the iteration until convergence, following the ideaof Schwarz Alternating Methods. Error estimates are derived to show that this algorithmalways converges provided that relaxation parameters are suitably chosen. Numeric experiments with matching and non-matching grids at the interface from different phases areperformed to show the accuracy of the method for capturing discontinuities in the solutionsand coefficients. In contrast to standard numerical methods, the accuracy of our methoddoes not seem to deteriorate as the coefficient discontinuity increases.

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

  5. Fin efficiency analysis of convective straight fins with temperature dependent thermal conductivity using variational iteration method

    Energy Technology Data Exchange (ETDEWEB)

    Coskun, Safa Bozkurt [Department of Civil Engineering, Nigde University, 51245 Nigde (Turkey)], E-mail: sbcoskun@nigde.edu.tr; Atay, Mehmet Tarik [Department of Mathematics, Nigde University, 51245 Nigde (Turkey)

    2008-12-15

    For enhancing heat transfer between primary surface and the environment, utilization of radiating extended surfaces are common. Especially for large temperature differences; variable thermal conductivity has a strong effect on performance of such a surface. In this paper, variational iteration method is used to analyze the efficiency of convective straight fins with temperature dependent thermal conductivity. VIM produces analytical expressions for the solution of nonlinear differential equations. In order to show the effectiveness of variational iteration method (VIM), the results obtained from VIM analysis is compared with available solutions obtained using Adomian decomposition method (ADM) and the results from finite element analysis. This work assures that VIM is a promising method for the efficiency analysis of convective straight fin problems.

  6. Asymptotic-Preserving Particle-In-Cell methods for the Vlasov-Maxwell system in the quasi-neutral limit

    Science.gov (United States)

    Degond, P.; Deluzet, F.; Doyen, D.

    2017-02-01

    In this article, we design Asymptotic-Preserving Particle-In-Cell methods for the Vlasov-Maxwell system in the quasi-neutral limit, this limit being characterized by a Debye length negligible compared to the space scale of the problem. These methods are consistent discretizations of the Vlasov-Maxwell system which, in the quasi-neutral limit, remain stable and are consistent with a quasi-neutral model (in this quasi-neutral model, the electric field is computed by means of a generalized Ohm law). The derivation of Asymptotic-Preserving methods is not straightforward since the quasi-neutral model is a singular limit of the Vlasov-Maxwell model. The key step is a reformulation of the Vlasov-Maxwell system which unifies the two models in a single set of equations with a smooth transition from one to another. As demonstrated in various and demanding numerical simulations, the Asymptotic-Preserving methods are able to treat efficiently both quasi-neutral plasmas and non-neutral plasmas, making them particularly well suited for complex problems involving dense plasmas with localized non-neutral regions.

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

    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 of a fun......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...... 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...

  8. A quadratic rate of asymptotic regularity for CAT(0)-spaces

    OpenAIRE

    Leustean, Laurentiu

    2005-01-01

    In this paper we obtain a quadratic bound on the rate of asymptotic regularity for the Krasnoselski-Mann iterations of nonexpansive mappings in CAT(0)-spaces, whereas previous results guarantee only exponential bounds. The method we use is to extend to the more general setting of uniformly convex hyperbolic spaces a quantitative version of a strengthening of Groetsch's theorem obtained by Kohlenbach using methods from mathematical logic (so-called ``proof mining'').

  9. Analytical approach to a generalized Hirota-Satsuma coupled Korteweg-de Vries equation by modified variational iteration method

    Directory of Open Access Journals (Sweden)

    Lu Jun-Feng

    2016-01-01

    Full Text Available In this paper, we apply the modified variational iteration method to a generalized Hirota-Satsuma coupled Korteweg-de Vries (KdV equation. The numerical solutions of the initial value problem of the generalized Hirota-Satsuma coupled KdV equation are provided. Numerical results are given to show the efficiency of the modified variational iteration method.

  10. Improvement of the image quality of random phase--free holography using an iterative method

    CERN Document Server

    Shimobaba, Tomoyoshi; Endo, Yutaka; Hirayama, Ryuji; Hiyama, Daisuke; Hasegawa, Satoki; Nagahama, Yuki; Sano, Marie; Oikawa, Minoru; Sugie, Takashige; Ito, Tomoyoshi

    2015-01-01

    Our proposed method of random phase-free holography using virtual convergence light can obtain large reconstructed images exceeding the size of the hologram, without the assistance of random phase. The reconstructed images have low-speckle noise in the amplitude and phase-only holograms (kinoforms); however, in low-resolution holograms, we obtain a degraded image quality compared to the original image. We propose an iterative random phase-free method with virtual convergence light to address this problem.

  11. The asymptotic convergence factor for a polygon under a perturbation

    Energy Technology Data Exchange (ETDEWEB)

    Li, X. [Georgia Southern Univ., Statesboro, GA (United States)

    1994-12-31

    Let Ax = b be a large system of linear equations, where A {element_of} C{sup NxN}, nonsingular and b {element_of} C{sup N}. A few iterative methods for solving have recently been presented in the case where A is nonsymmetric. Many of their algorithms consist of two phases: Phase I: estimate the extreme eigenvalues of A; Phase II: construct and apply an iterative method based on the estimates. For convenience, it is rewritten as an equivalent fixed-point form, x = Tx + c. Let {Omega} be a compact set excluding 1 in the complex plane, and let its complement in the extended complex plane be simply connected. The asymptotic convergence factor (ACF) for {Omega}, denoted by {kappa}({Omega}), measures the rate of convergence for the asymptotically optimal semiiterative methods for solving, where {sigma}(T) {contained_in} {Omega}.

  12. THE PRECONDITIONING SUBSPACE ITERATION METHOD ACCELERATED BY CHEBYSHEV ITERATION%用Chebyshev多项式加速的预处理子空间迭代法

    Institute of Scientific and Technical Information of China (English)

    曲庆国; 徐大举

    2012-01-01

    研究了计算大型稀疏对称矩阵的若干个最大或最小特征值的问题,首先引入了求解大型对称特征值问题的预处理子空间迭代法和Chebyshev迭代法,并对其作了理论分析.为了加速顶处理子空间迭代法的收敛性,笔者采用组合Chebyshev迭代法和预处理子空间选代法,提出了计算大型对称稀疏矩阵的几个最大或最小特征值的Chebyshev预处理子空间迭代法.数值结果表明,该方法比预处理子空间方法优越.%The problem of computing a few of the largest (or smallest) eigenvalues of a large symmetric sparse matrix is dealt with. This paper considers the preconditioning subspace iteration method and the Chebyshev iteration, and analyzes them. In order to accelerate the convergence rate of the preconditioning subspace iteration method,a new method, i. e. Chebyshev -PSI(the preconditioning subspace iteration) method, is presented for computing the extreme eigenvalues of a large symmetric sparse matrix. The new method combines the Chebyshev iteration with the PSI method. Numerical experiments show that the Chebyshev - PS1 metod is very effective for computing the extreme eigenvalues of a large symmetric sparse matrix.

  13. Simultaneous determination of electron beam profile and material response using self-consistent iterative method

    Science.gov (United States)

    Kandel, Yudhishthir; Denbeaux, Gregory

    2016-08-01

    We develop a novel iterative method to accurately measure electron beam shape (current density distribution) and monotonic material response as a function of position. A common method is to scan an electron beam across a knife edge along many angles to give an approximate measure of the beam profile, however such scans are not easy to obtain in all systems. The present work uses only an electron beam and multiple exposed regions of a thin film of photoresist to measure the complete beam profile for any beam shape, where the material response is characterized externally. This simplifies the setup of new experimental tools. We solve for self-consistent photoresist thickness loss response to dose and the electron beam profile simultaneously by optimizing a novel functional iteratively. We also show the successful implementation of the method in a real world data set corrupted by noise and other experimental variabilities.

  14. A fully nonlinear iterative solution method for self-similar potential flows with a free boundary

    CERN Document Server

    Iafrati, Alessandro

    2013-01-01

    An iterative solution method for fully nonlinear boundary value problems governing self-similar flows with a free boundary is presented. Specifically, the method is developed for application to water entry problems, which can be studied under the assumptions of an ideal and incompressible fluid with negligible gravity and surface tension effects. The approach is based on a pseudo time stepping procedure, which uses a boundary integral equation method for the solution of the Laplace problem governing the velocity potential at each iteration. In order to demonstrate the flexibility and the capabilities of the approach, several applications are presented: the classical wedge entry problem, which is also used for a validation of the approach, the block sliding along an inclined sea bed, the vertical water entry of a flat plate and the ditching of an inclined plate. The solution procedure is also applied to cases in which the body surface is either porous or perforated. Comparisons with numerical or experimental d...

  15. The bias of the unbiased estimator: a study of the iterative application of the BLUE method

    CERN Document Server

    Lista, Luca

    2014-01-01

    The best linear unbiased estimator (BLUE) is a popular statistical method adopted to combine multiple measurements of the same observable, taking into account individual uncertainties and their correlation. The method is unbiased by construction if the true uncertainties and their correlation are known, but it may exhibit a bias if uncertainty estimates are used in place of the true ones, in particular if those uncertainties depend on the true value of the measured quantity. This is the case for instance when contributions to the total uncertainty are known as relative uncertainties. In those cases, an iterative application of the BLUE method may reduce the bias of the combined measurement. The impact of the iterative approach compared to the standard BLUE application is studied for a wide range of possible values of uncertainties and their correlation in the case of the combination of two measurements.

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

  17. Asymptotics of Wigner 3nj-symbols with Small and Large Angular Momenta: an Elementary Method

    CERN Document Server

    Bonzom, Valentin

    2011-01-01

    Yu and Littlejohn recently studied in 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 is 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.

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

  19. Solving singular perturbation problem of second order ordinary differential equation using the method of matched asymptotic expansion (MMAE)

    Science.gov (United States)

    Mohamed, Firdawati binti; Karim, Mohamad Faisal bin Abd

    2015-10-01

    Modelling physical problems in mathematical form yields the governing equations that may be linear or nonlinear for known and unknown boundaries. The exact solution for those equations may or may not be obtained easily. Hence we seek an analytical approximation solution in terms of asymptotic expansion. In this study, we focus on a singular perturbation in second order ordinary differential equations. Solutions to several perturbed ordinary differential equations are obtained in terms of asymptotic expansion. The aim of this work is to find an approximate analytical solution using the classical method of matched asymptotic expansion (MMAE). The Mathematica computer algebra system is used to perform the algebraic computations. The details procedures will be discussed and the underlying concepts and principles of the MMAE will be clarified. Perturbation problem for linear equation that occurs at one boundary and two boundary layers are discussed. Approximate analytical solution obtained for both cases are illustrated by graph using selected parameter by showing the outer, inner and composite solution separately. Then, the composite solution will be compare to the exact solution to show their accuracy by graph. By comparison, MMAE is found to be one of the best methods to solve singular perturbation problems in second order ordinary differential equation since the results obtained are very close to the exact solution.

  20. Computation of Floquet Multipliers Using an Iterative Method for Variational Equations

    Science.gov (United States)

    Nureki, Yu; Murashige, Sunao

    This paper proposes a new method to numerically obtain Floquet multipliers which characterize stability of periodic orbits of ordinary differential equations. For sufficiently smooth periodic orbits, we can compute Floquet multipliers using some standard numerical methods with enough accuracy. However, it has been reported that these methods may produce incorrect results under some conditions. In this work, we propose a new iterative method to compute Floquet multipliers using eigenvectors of matrix solutions of the variational equations. Numerical examples show effectiveness of the proposed method.

  1. Iterative reconstruction methods in atmospheric tomography: FEWHA, Kaczmarz and Gradient-based algorithm

    Science.gov (United States)

    Ramlau, R.; Saxenhuber, D.; Yudytskiy, M.

    2014-07-01

    The problem of atmospheric tomography arises in ground-based telescope imaging with adaptive optics (AO), where one aims to compensate in real-time for the rapidly changing optical distortions in the atmosphere. Many of these systems depend on a sufficient reconstruction of the turbulence profiles in order to obtain a good correction. Due to steadily growing telescope sizes, there is a strong increase in the computational load for atmospheric reconstruction with current methods, first and foremost the MVM. In this paper we present and compare three novel iterative reconstruction methods. The first iterative approach is the Finite Element- Wavelet Hybrid Algorithm (FEWHA), which combines wavelet-based techniques and conjugate gradient schemes to efficiently and accurately tackle the problem of atmospheric reconstruction. The method is extremely fast, highly flexible and yields superior quality. Another novel iterative reconstruction algorithm is the three step approach which decouples the problem in the reconstruction of the incoming wavefronts, the reconstruction of the turbulent layers (atmospheric tomography) and the computation of the best mirror correction (fitting step). For the atmospheric tomography problem within the three step approach, the Kaczmarz algorithm and the Gradient-based method have been developed. We present a detailed comparison of our reconstructors both in terms of quality and speed performance in the context of a Multi-Object Adaptive Optics (MOAO) system for the E-ELT setting on OCTOPUS, the ESO end-to-end simulation tool.

  2. Decoherence suppression for three-qubit W-like state using weak measurement and iteration method

    Science.gov (United States)

    Yang, Guang; Lian, Bao-Wang; Nie, Min

    2016-08-01

    Multi-qubit entanglement states are the key resources for various multipartite quantum communication tasks. For a class of generalized three-qubit quantum entanglement, W-like state, we demonstrate that the weak measurement and the reversal measurement are capable of suppressing the amplitude damping decoherence by reducing the initial damping factor into a smaller equivalent damping factor. Furthermore, we propose an iteration method in the weak measurement and the reversal measurement to enhance the success probability of the total measurements. Finally, we discuss how the number of the iterations influences the overall effect of decoherence suppression, and find that the “half iteration” method is a better option that has more practical value. Project supported by the National Natural Science Foundation of China (Grant No. 61172071), the International Scientific Cooperation Program of Shaanxi Province, China (Grant No. 2015KW-013), and the Scientific Research Program Funded by Shaanxi Provincial Education Department, China (Grant No. 16JK1711).

  3. Least Squares Ranking on Graphs, Hodge Laplacians, Time Optimality, and Iterative Methods

    CERN Document Server

    Hirani, Anil N; Watts, Seth

    2010-01-01

    Given a set of alternatives to be ranked and some pairwise comparison values, ranking can be posed as a least squares computation on a graph. This was first used by Leake for ranking football teams. The residual can be further analyzed to find inconsistencies in the given data, and this leads to a second least squares problem. This whole process was formulated recently by Jiang et al. as a Hodge decomposition of the edge values. Recently, Koutis et al., showed that linear systems involving symmetric diagonally dominant (SDD) matrices can be solved in time approaching optimality. By using Hodge 0-Laplacian and 2-Laplacian, we give various results on when the normal equations for ranking are SDD and when iterative Krylov methods should be used. We also give iteration bounds for conjugate gradient method for these problems.

  4. Path Planning for Mobile Robots using Iterative Artificial Potential Field Method

    Directory of Open Access Journals (Sweden)

    Hossein Adeli

    2011-07-01

    Full Text Available In this paper, a new algorithm is proposed for solving the path planning problem of mobile robots. The algorithm is based on Artificial Potential Field (APF methods that have been widely used for path planning related problems for more than two decades. While keeping the simplicity of traditional APF methods, our algorithm is built upon new potential functions based on the distances from obstacles, destination point and start point. The algorithm uses the potential field values iteratively to find the optimum points in the workspace in order to form the path from start to destination. The number of iterations depends on the size and shape of the workspace. The performance of the proposed algorithm is tested by conducting simulation experiments.

  5. Convergence of Variational Iteration Method for Solving Singular Partial Differential Equations of Fractional Order

    Directory of Open Access Journals (Sweden)

    Asma Ali Elbeleze

    2014-01-01

    Full Text Available We are concerned here with singular partial differential equations of fractional order (FSPDEs. The variational iteration method (VIM is applied to obtain approximate solutions of this type of equations. Convergence analysis of the VIM is discussed. This analysis is used to estimate the maximum absolute truncated error of the series solution. A comparison between the results of VIM solutions and exact solution is given. The fractional derivatives are described in Caputo sense.

  6. Recent advances in Lanczos-based iterative methods for nonsymmetric linear systems

    Science.gov (United States)

    Freund, Roland W.; Golub, Gene H.; Nachtigal, Noel M.

    1992-01-01

    In recent years, there has been a true revival of the nonsymmetric Lanczos method. On the one hand, the possible breakdowns in the classical algorithm are now better understood, and so-called look-ahead variants of the Lanczos process have been developed, which remedy this problem. On the other hand, various new Lanczos-based iterative schemes for solving nonsymmetric linear systems have been proposed. This paper gives a survey of some of these recent developments.

  7. An efficient reconstruction method for bioluminescence tomography based on two-step iterative shrinkage approach

    Science.gov (United States)

    Guo, Wei; Jia, Kebin; Tian, Jie; Han, Dong; Liu, Xueyan; Wu, Ping; Feng, Jinchao; Yang, Xin

    2012-03-01

    Among many molecular imaging modalities, Bioluminescence tomography (BLT) is an important optical molecular imaging modality. Due to its unique advantages in specificity, sensitivity, cost-effectiveness and low background noise, BLT is widely studied for live small animal imaging. Since only the photon distribution over the surface is measurable and the photo propagation with biological tissue is highly diffusive, BLT is often an ill-posed problem and may bear multiple solutions and aberrant reconstruction in the presence of measurement noise and optical parameter mismatches. For many BLT practical applications, such as early detection of tumors, the volumes of the light sources are very small compared with the whole body. Therefore, the L1-norm sparsity regularization has been used to take advantage of the sparsity prior knowledge and alleviate the ill-posedness of the problem. Iterative shrinkage (IST) algorithm is an important research achievement in a field of compressed sensing and widely applied in sparse signal reconstruction. However, the convergence rate of IST algorithm depends heavily on the linear operator. When the problem is ill-posed, it becomes very slow. In this paper, we present a sparsity regularization reconstruction method for BLT based on the two-step iterated shrinkage approach. By employing Two-step strategy of iterative reweighted shrinkage (IRS) to improve IST, the proposed method shows faster convergence rate and better adaptability for BLT. The simulation experiments with mouse atlas were conducted to evaluate the performance of proposed method. By contrast, the proposed method can obtain the stable and comparable reconstruction solution with less number of iterations.

  8. Approximate Solution of Time-Fractional Advection-Dispersion Equation via Fractional Variational Iteration Method

    Directory of Open Access Journals (Sweden)

    Birol İbiş

    2014-01-01

    Full Text Available This paper aims to obtain the approximate solution of time-fractional advection-dispersion equation (FADE involving Jumarie’s modification of Riemann-Liouville derivative by the fractional variational iteration method (FVIM. FVIM provides an analytical approximate solution in the form of a convergent series. Some examples are given and the results indicate that the FVIM is of high accuracy, more efficient, and more convenient for solving time FADEs.

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

  10. LOCAL FRACTIONAL VARIATIONAL ITERATION METHOD FOR SOLVING VOLTERRA INTEGRO-DIFFERENTIAL EQUATIONS WITHIN LOCAL FRACTIONAL OPERATORS

    Directory of Open Access Journals (Sweden)

    Ammar Ali Neamah

    2014-01-01

    Full Text Available The paper uses the Local fractional variational Iteration Method for solving the second kind Volterra integro-differential equations within the local fractional integral operators. The analytical solutions within the non-differential terms are discussed. Some illustrative examples will be discussed. The obtained results show the simplicity and efficiency of the present technique with application to the problems for the integral equations.

  11. Iterative Method for Constructing Complete Complementary Sequences with Lengths of 2mN

    Institute of Scientific and Technical Information of China (English)

    ZHANG Chao; HAN Chenggao; LIAO Yiting; LIN Xiaokang; HATORI Mitsutoshi

    2005-01-01

    Complete complementary sequences are widely used in spectrum spread communications because of their ideal correlation functions. A previous method generates complete complementary sequences with lengths of NnN (n,N∈Z+). This paper presents a new iterative method to construct complete complementary sequences with lengths of 2mN (m,N∈Z+). The analysis proves that this method can produce many sequence sets that do not appear in sequence sets generated by the former method, especially shorter sequence sets. The result will certainly increase the application of complete complementary sequences in communication engineering and related fields.

  12. A NEW SELF-ADAPTIVE ITERATIVE METHOD FOR GENERAL MIXED QUASI VARIATIONAL INEQUALITIES

    Institute of Scientific and Technical Information of China (English)

    Abdellah Bnouhachem; Mohamed Khalfaoui; Hafida Benazza

    2008-01-01

    The general mixed quasi variational inequality containing a nonlinear term ψ is a useful and an important generalization of variational inequalities. The projection method can not be applied to solve this problem due to the presence of nonlinear term. It is well known that the variational inequalities involving the nonlinear term ψ are equivalent to the fixed point problems and re, solvent equations. In this article, the authors use these alternative equivalent formulations to suggest and analyze a new self-adaptive iterative method for solving general mixed quasi variational inequalities. Global convergence of the new method is proved. An example is given to illustrate the efficiency of the proposed method.

  13. Numerical Solutions of the Multispecies Predator-Prey Model by Variational Iteration Method

    Directory of Open Access Journals (Sweden)

    Khaled Batiha

    2007-01-01

    Full Text Available The main objective of the current work was to solve the multispecies predator-prey model. The techniques used here were called the variational iteration method (VIM and the Adomian decomposition method (ADM. The advantage of this work is twofold. Firstly, the VIM reduces the computational work. Secondly, in comparison with existing techniques, the VIM is an improvement with regard to its accuracy and rapid convergence. The VIM has the advantage of being more concise for analytical and numerical purposes. Comparisons with the exact solution and the fourth-order Runge-Kutta method (RK4 show that the VIM is a powerful method for the solution of nonlinear equations.

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

    Energy Technology Data Exchange (ETDEWEB)

    Zeile, Christian, E-mail: christian.zeile@kit.edu; Maione, Ivan A.

    2015-10-15

    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.

  15. Asymptotically nonexpansive mappings in uniformly convex hyperbolic spaces

    OpenAIRE

    Kohlenbach, Ulrich; Leuştean, Laurentiu

    2007-01-01

    This paper provides a fixed point theorem for asymptotically nonexpansive mappings in uniformly convex hyperbolic spaces as well as new effective results on the Krasnoselski-Mann iterations of such mappings. The latter were found using methods from logic and the paper continues a case study in the general program of extracting effective data from prima-facie ineffective proofs in the fixed point theory of such mappings.

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

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

  18. An iterative Rankine boundary element method for wave diffraction of a ship with forward speed

    Institute of Scientific and Technical Information of China (English)

    何广华

    2014-01-01

    A 3-D time-domain seakeeping analysis tool has been newly developed by using a higher-order boundary element method with the Rankine source as the kernel function. An iterative time-marching scheme for updating both kinematic and dynamic free-surface boundary conditions is adopted for achieving numerical accuracy and stability. A rectangular computational domain moving with the mean speed of ship is introduced. A damping beach at the outer portion of the truncated free surface is installed for satisfying the radiation condition. After numerical convergence checked, the diffraction unsteady problem of a Wigley hull traveling with a constant forward speed in waves is studied. Extensive results including wave exciting forces, wave patterns and pressure distributions on the hull are presented to validate the efficiency and accuracy of the proposed 3-D time-domain iterative Rankine BEM approach. Computed results are compared to be in good agreement with the corresponding experimental data and other published numerical solutions.

  19. The Polynomial Pivots as Initial Values for a New Root-Finding Iterative Method

    Directory of Open Access Journals (Sweden)

    Mario Lázaro

    2015-01-01

    Full Text Available A new iterative method for polynomial root-finding based on the development of two novel recursive functions is proposed. In addition, the concept of polynomial pivots associated with these functions is introduced. The pivots present the property of lying close to some of the roots under certain conditions; this closeness leads us to propose them as efficient starting points for the proposed iterative sequences. Conditions for local convergence are studied demonstrating that the new recursive sequences converge with linear velocity. Furthermore, an a priori checkable global convergence test inside pivots-centered balls is proposed. In order to accelerate the convergence from linear to quadratic velocity, new recursive functions together with their associated sequences are constructed. Both the recursive functions (linear and the corrected (quadratic convergence are validated with two nontrivial numerical examples. In them, the efficiency of the pivots as starting points, the quadratic convergence of the proposed functions, and the validity of the theoretical results are visualized.

  20. Efficient iterative method for solving the Dirac-Kohn-Sham density functional theory

    Energy Technology Data Exchange (ETDEWEB)

    Lin, Lin; Shao, Sihong; E, Weinan

    2012-11-06

    We present for the first time an efficient iterative method to directly solve the four-component Dirac-Kohn-Sham (DKS) density functional theory. Due to the existence of the negative energy continuum in the DKS operator, the existing iterative techniques for solving the Kohn-Sham systems cannot be efficiently applied to solve the DKS systems. The key component of our method is a novel filtering step (F) which acts as a preconditioner in the framework of the locally optimal block preconditioned conjugate gradient (LOBPCG) method. The resulting method, dubbed the LOBPCG-F method, is able to compute the desired eigenvalues and eigenvectors in the positive energy band without computing any state in the negative energy band. The LOBPCG-F method introduces mild extra cost compared to the standard LOBPCG method and can be easily implemented. We demonstrate our method in the pseudopotential framework with a planewave basis set which naturally satisfies the kinetic balance prescription. Numerical results for Pt$_{2}$, Au$_{2}$, TlF, and Bi$_{2}$Se$_{3}$ indicate that the LOBPCG-F method is a robust and efficient method for investigating the relativistic effect in systems containing heavy elements.

  1. Inexact Krylov iterations and relaxation strategies with fast-multipole boundary element method

    CERN Document Server

    Layton, Simon K

    2015-01-01

    Boundary element methods produce dense linear systems that can be accelerated via multipole expansions. Solved with Krylov methods, this implies computing the matrix-vector products within each iteration with some error, at an accuracy controlled by the order of the expansion, $p$. We take advantage of a unique property of Krylov iterations that allow lower accuracy of the matrix-vector products as convergence proceeds, and propose a relaxation strategy based on progressively decreasing $p$. Via extensive numerical tests, we show that the relaxed Krylov iterations converge with speed-ups of between 2x and 4x for Laplace problems and between 3.5x and 4.5x for Stokes problems. We include an application to Stokes flow around red blood cells, computing with up to 64 cells and problem size up to 131k boundary elements and nearly 400k unknowns. The study was done with an in-house multi-threaded C++ code, on a quad-core CPU.

  2. Strong Convergence Theorems for Mixed Typ e Asymptotically Nonexpansive Mappings

    Institute of Scientific and Technical Information of China (English)

    Wei Shi-long; Guo Wei-ping

    2015-01-01

    The purpose of this paper is to study a new two-step iterative scheme with mean errors of mixed type for two asymptotically nonexpansive self-mappings and two asymptotically nonexpansive nonself-mappings and prove strong convergence theorems for the new two-step iterative scheme in uniformly convex Banach spaces.

  3. Solving Fractional Partial Differential Equations with Variable Coefficients by the Reconstruction of Variational Iteration Method

    Science.gov (United States)

    Hesameddini, Esmail; Rahimi, Azam

    2015-05-01

    In this article, we propose a new approach for solving fractional partial differential equations with variable coefficients, which is very effective and can also be applied to other types of differential equations. The main advantage of the method lies in its flexibility for obtaining the approximate solutions of time fractional and space fractional equations. The fractional derivatives are described based on the Caputo sense. Our method contains an iterative formula that can provide rapidly convergent successive approximations of the exact solution if such a closed form solution exists. Several examples are given, and the numerical results are shown to demonstrate the efficiency of the newly proposed method.

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

  5. Application of Homotopy Perturbation and Variational Iteration Methods to SIR Epidemic Model

    DEFF Research Database (Denmark)

    Ghotbi, Abdoul R.; Barari, Amin; Omidvar, M.;

    2011-01-01

    Children born are susceptible to various diseases such as mumps, chicken pox etc. These diseases are the most common form of infectious diseases. In recent years, scientists have been trying to devise strategies to fight against these diseases. Since vaccination is considered to be the most....... In this article two methods namely Homotopy Perturbation Method (HPM) and Variational Iteration Method (VIM) are employed to compute an approximation to the solution of non-linear system of differential equations governing the problem. The obtained results are compared with those obtained by Adomian Decomposition...

  6. An iterative regularization method for nonlinear problems based on Bregman projections

    Science.gov (United States)

    Maaß, Peter; Strehlow, Robin

    2016-11-01

    In this paper, we present an iterative method for the regularization of ill-posed, nonlinear problems. The approach is based on the Bregman projection onto stripes the width of which is controlled by both the noise level and the structure of the operator. In our investigations, we follow (Lorenz et al 2014 SIAM J. Imaging Sci. 7 1237-62) and extend the respective method to the setting of nonlinear operators. Furthermore, we present a proof for the regularizing properties of the method.

  7. An Exploratory Study of a Subspace Iteration Method as an Alternative to the QR Method for Floquet Eigenanalysis

    Science.gov (United States)

    Achar, N. S.; Gaonkar, G. H.

    1994-01-01

    Floquet eigenanalysis requires a few dominant eigenvalues of the Floquet transition matrix (FTM). Although the QR method is used almost exclusively, it is expensive for such partial eigenanalysis; the operation counts and, thereby, the approximate machine-time grow cubically with the matrix order. Accordingly, for Floquet eigenanalysis, the Arnold-Saad method, a subspace iteration method, is investigated as an alternative to the QR method. The two methods are compared for machine-time efficiency and the residual errors of the corresponding eigenpairs. The Arnolds-Saad method takes much less machine-time than the QR method with comparable computational reliability and offers promise fpr large-scale Floquet eigenanalysis.

  8. A POCS method for iterative deblending constrained by a blending mask

    Science.gov (United States)

    Zhou, Yatong

    2017-03-01

    A recently emerging seismic acquisition technology called simultaneous source shooting has attracted much attention from both academia and industry. The key topic in the newly developed technique is the removal of intense blending interferences caused by the simultaneous ignition of multiple airgun sources. In this paper, I propose a novel inversion strategy with multiple convex constraints to improve the deblending performance based on the projection onto convex sets (POCS) iterative framework. In the POCS iterative framework, as long as the multiple constraints are convex, the iterations are guaranteed to converge. In addition to the sparse constraint, I seek another important constraint from the untainted data. I create a blending mask in order to fully utilize the useful information hidden behind the noisy blended data. The blending mask is constructed by numerically blending a matrix with all its entries set to be one and then setting the non-one entries of the blended matrix zero. I use both synthetic and field data examples to demonstrate the successful performance of the proposed method.

  9. An LMI Method to Robust Iterative Learning Fault-tolerant Guaranteed Cost Control for Batch Processes

    Institute of Scientific and Technical Information of China (English)

    WANG Limin; CHEN Xi; GAO Furong

    2013-01-01

    Based on an equivalent two-dimensional Fornasini-Marchsini model for a batch process in industry,a closed-loop robust iterative learning fault-tolerant guaranteed cost control scheme is proposed for batch processes with actuator failures.This paper introduces relevant concepts of the fault-tolerant guaranteed cost control and formulates the robust iterative learning reliable guaranteed cost controller (ILRGCC).A significant advantage is that the proposed ILRGCC design method can be used for on-line optimization against batch-to-batch process uncertainties to realize robust tracking of set-point trajectory in time and batch-to-batch sequences.For the convenience of implementation,only measured output errors of current and previous cycles are used to design a synthetic controller for iterative learning control,consisting of dynamic output feedback plus feed-forward control.The proposed controller can not only guarantee the closed-loop convergency along time and cycle sequences but also satisfy the H∞ performance level and a cost function with upper bounds for all admissible uncertainties and any actuator failures.Sufficient conditions for the controller solution are derived in terms of linear matrix inequalities (LMIs),and design procedures,which formulate a convex optimization problem with LMI constraints,are presented.An example of injection molding is given to illustrate the effectiveness and advantages of the ILRGCC design approach.

  10. Decision-directed iterative methods for PAPR reduction in optical wireless OFDM systems

    Science.gov (United States)

    Azim, Ali W.; Le Guennec, Yannis; Maury, Ghislaine

    2017-04-01

    In this paper, we propose two iterative decision-directed methods for peak-to-average power ratio (PAPR) reduction in optical-orthogonal frequency division multiplexing (O-OFDM) systems. The proposed methods are applicable to state-of-the-art intensity modulation-direct detection (IM-DD) O-OFDM techniques for optical wireless communication (OWC) systems, including both direct-current (DC) biased O-OFDM (DCO-OFDM), and asymmetrically clipped O-OFDM (ACO-OFDM). Conventional O-OFDM suffers from high power consumption due to high PAPR. The high PAPR of the O-OFDM signal can be counteracted by clipping the signal to a predefined threshold. However, because of clipping an inevitable distortion occurs due to the loss of useful information, thus, clipping mitigation methods are required. The proposed iterative decision-directed methods operate at the receiver, and recover the lost information by mitigating the clipping distortion. Simulation results acknowledge that the high PAPR of O-OFDM can be significantly reduced using clipping, and the proposed methods can successfully circumvent the clipping distortions. Furthermore, the proposed PAPR reduction methods exhibit a much lower computational complexity compared to standard PAPR reduction methods.

  11. Quadrature Rules and Iterative Method for Numerical Solution of Two-Dimensional Fuzzy Integral Equations

    Directory of Open Access Journals (Sweden)

    S. M. Sadatrasoul

    2014-01-01

    Full Text Available We introduce some generalized quadrature rules to approximate two-dimensional, Henstock integral of fuzzy-number-valued functions. We also give error bounds for mappings of bounded variation in terms of uniform modulus of continuity. Moreover, we propose an iterative procedure based on quadrature formula to solve two-dimensional linear fuzzy Fredholm integral equations of the second kind (2DFFLIE2, and we present the error estimation of the proposed method. Finally, some numerical experiments confirm the theoretical results and illustrate the accuracy of the method.

  12. Iteration method for the inversion of simulated multiwavelength lidar signals to determine aerosol size distribution

    Institute of Scientific and Technical Information of China (English)

    Tao Zong-Ming; Zhang Yin-Chao; Liu Xiao-Qin; Tan Kun; Shao Shi-Sheng; Hu Huan-Ling; Zhang Gai-Xia; Lü Yong-Hui

    2004-01-01

    A new method is proposed to derive the size distribution of aerosol from the simulated multiwavelength lidar extinction coefficients. The basis for this iteration is to consider the extinction efficiency factor of particles as a set of weighting function covering the entire radius region of a distribution. The weighting functions are calculated exactly from Mie theory. This method extends the inversion region by subtracting some extinction coefficient. The radius range of simulated size distribution is 0.1-10.0μm, the inversion radius range is 0.1-2.0μm, but the inverted size distributions are in good agreement with the simulated one.

  13. Land cover classification of remotely sensed image with hierarchical iterative method

    Institute of Scientific and Technical Information of China (English)

    LI Peijun; HUANG Yingduan

    2005-01-01

    Based on the analysis of the single-stage classification results obtained by the multitemporal SPOT 5 and Landsat 7 ETM + multispectral images separately and the derived variogram texture, the best data combinations for each land cover class are selected, and the hierarchical iterative classification is then applied for land cover mapping. The proposed classification method combines the multitemporal images of different resolutions with the image texture, which can greatly improve the classification accuracy. The method and strategies proposed in the study can be easily transferred to other similar applications.

  14. Investigation on vibration of single-walled carbon nanotubes by variational iteration method

    Science.gov (United States)

    Ahmadi Asoor, A. A.; Valipour, P.; Ghasemi, S. E.

    2016-02-01

    In this paper, the variational iteration method (VIM) has been used to investigate the non-linear vibration of single-walled carbon nanotubes (SWCNTs) based on the nonlocal Timoshenko beam theory. The accuracy of results is examined by the fourth-order Runge-Kutta numerical method. Comparison between VIM solutions with numerical results leads to highly accurate solutions. Also, the behavior of deflection and frequency in vibrations of SWCNTs are studied. The results show that frequency of single walled carbon nanotube versus amplitude increases by increasing the values of B.

  15. An iterative method for coil sensitivity estimation in multi-coil MRI systems.

    Science.gov (United States)

    Ling, Qiang; Li, Zhaohui; Song, Kaikai; Li, Feng

    2014-12-01

    This paper presents an iterative coil sensitivity estimation method for multi-coil MRI systems. The proposed method works with coil images in the magnitude image domain. It determines a region of support (RoS), a region being composed of the same type of tissues, by a region growing algorithm, which makes use of both intensities and intensity gradients of pixels. By repeating this procedure, it can determine multiple regions of support, which together cover most of the concerned image area. The union of these regions of support provides a rough estimate of the sensitivity of each coil through dividing the intensities of pixels by the average intensity inside every region of support. The obtained rough coil sensitivity estimate is further approached with the product of multiple low-order polynomials, rather than a single one. The product of these polynomials provides a smooth estimate of the sensitivity of each coil. With the obtained sensitivities of coils, it can produce a better reconstructed image, which determines more correct regions of support and yields preciser estimates of the sensitivities of coils. In other words, the method can be iteratively implemented to improve the estimation performance. The proposed method was verified through both simulated data and clinical data from different body parts. The experimental results confirm the superiority of our method to some conventional methods.

  16. Experimental and theoretical studies of iterative methods for nonlinear, nonsymmetric systems arising in combustion

    Energy Technology Data Exchange (ETDEWEB)

    Hagstrom, T. [Univ. of New Mexico, Albuquerque, NM (United States); Radhakrishnan, K. [Sverdrup Technology, Brook Park, OH (United States)

    1994-12-31

    The authors report on some iterative methods which they have tested for use in combustion simulations. In particular, they have developed a code to solve zero Mach number reacting flow equations with complex reaction and diffusion physics. These equations have the form of a nonlinear parabolic system coupled with constraints. In semi-discrete form, one obtains DAE`s of index two or three depending on the number of spatial dimensions. The authors have implemented a fourth order (fully implicit) BDF method in time, coupled with a suite of fourth order explicit and implicit spatial difference approximations. Most codes they know of for simulating reacting flows use a splitting strategy to march in time. This results in a sequence of nonlinear systems to solve, each of which has a simpler structure than the one they are faced with. The rapid and robust solution of the coupled system is the essential requirement for the success of their approach. They have implemented and analyzed nonlinear generalizations of conjugate gradient-like methods for nonsymmetric systems, including CGS and the quasi-Newton based method of Eirola and Nevanlinna. They develop a general framework for the nonlinearization of linear methods in terms of the acceleration of fixed-point iterations, where the latter is assumed to include the {open_quote}preconditioning{open_quote}. Their preconditioning is a single step of a split method, using lower order spatial difference approximations as well as simplified (Fickian) approximations of the diffusion physics.

  17. A New Iterative Scheme of Modified Mann Iteration in Banach Space

    Directory of Open Access Journals (Sweden)

    Jinzuo Chen

    2014-01-01

    Full Text Available We introduce the modified iterations of Mann's type for nonexpansive mappings and asymptotically nonexpansive mappings to have the strong convergence in a uniformly convex Banach space. We study approximation of common fixed point of asymptotically nonexpansive mappings in Banach space by using a new iterative scheme. Applications to the accretive operators are also included.

  18. Global/Local iterative homogenization methods for neutron diffusion nodal theory

    Energy Technology Data Exchange (ETDEWEB)

    Kim, Hark Rho

    1994-02-15

    The objective of this research is to develop efficient spatial homogenization methods for coarse-mesh nodal analysis of the light water reactors in which the reference solutions are not known. The methods developed are the global/local iterative procedures, including procedures based on variational principles. The nodal expansion method (NEM) with generalized equivalence theory is employed in coarse-mesh nodal analysis. The finite difference method (FDM) is used in fine-mesh local assembly calculation. To achieve fast and stable convergence in local assembly calculation, the mixed boundary condition is imposed at the assembly surface, where the surface flux is modulated. The assembly wise fundamental mode eigenfunction is used as the modulating function. Two direct methods are developed for the global/local iterative homogenization : G{sub 1} and G{sub 2}·G{sub 1} procedure is based on the rigorous definition of the flux-weighted constants (FWCs) and G{sub 2} procedure preserves the reaction rate ratio. Three variational principles are also proposed for the assembly homogenization. The basic form is inferred from the Pomraning's variational principle. Since the two variational methods, F{sub 0} and F{sub 2}, are based on the ratio of reaction rates, these are insensitive to the amplitude of the flux and hence they are of the Lagrangian form. On the while, the other variational principle F{sub 1} is based on the reaction rate and this requires a normalization due to its property that is sensitive to the amplitude of the flux. Thus the resulting form of F{sub 1} becomes the Swinger type. The homogenization methods developed were applied to the LWR problems. In the PWR problems we treated, there is no strong need for a global/local iterative homogenization procedure, since the heterogeneity between the fuel assemblies is relatively weak. Using the assembly discontinuity factor(ADF), the nodal analysis was improved with reasonable accuracy, while no significant

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

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

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

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

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

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

  5. Modelling CH$_3$OH masers: Sobolev approximation and accelerated lambda iteration method

    CERN Document Server

    Nesterenok, Aleksandr

    2015-01-01

    A simple one-dimensional model of CH$_3$OH maser is considered. Two techniques are used for the calculation of molecule level populations: the accelerated lambda iteration (ALI) method and the large velocity gradient (LVG), or Sobolev, approximation. The LVG approximation gives accurate results provided that the characteristic dimensions of the medium are larger than 5-10 lengths of the resonance region. We presume that this condition can be satisfied only for the largest observed maser spot distributions. Factors controlling the pumping of class I and class II methanol masers are considered.

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

  7. A variation iteration method for isotropic velocity-dependent potentials: Scattering case

    Energy Technology Data Exchange (ETDEWEB)

    Eed, H. [Applied Science Private University, Basic Science Department, Amman (Jordan)

    2014-12-01

    We propose a new approximation scheme to obtain analytic expressions for the Schroedinger equation with isotropic velocity-dependent potential to determine the scattering phase shift. In order to test the validity of our approach, we applied it to an exactly solvable model for nucleon-nucleon scattering. The results of the variation iteration method (VIM) formalism compare quite well with those of the exactly solvable model. The developed formalism can be applied in problems concerning pion-nucleon, nucleon-nucleon, and electron-atom scattering. (orig.)

  8. One Fairing Method of Cubic B-spline Curves Based on Weighted Progressive Iterative Approximation

    Institute of Scientific and Technical Information of China (English)

    ZHANG Li; YANG Yan; LI Yuan-yuan; TAN Jie-qing

    2014-01-01

    A new method to the problem of fairing planar cubic B-spline curves is introduced in this paper. The method is based on weighted progressive iterative approximation (WPIA for short) and consists of following steps:finding the bad point which needs to fair, deleting the bad point, re-inserting a new data point to keep the structure of the curve and applying WPIA method with the new set of the data points to obtain the faired curve. The new set of the data points is formed by the rest of the original data points and the new inserted point. The method can be used for shape design and data processing. Numerical examples are provided to demonstrate the effectiveness of the method.

  9. Peak to Average Power Ratio Reduction of OFDM Signals Using Clipping and Iterative Processing Methods

    Directory of Open Access Journals (Sweden)

    Ahmed K. Hassan

    2008-01-01

    Full Text Available One of the serious problems in any wireless communication system using multi carrier modulation technique like Orthogonal Frequency Division Multiplexing (OFDM is its Peak to Average Power Ratio (PAPR.It limits the transmission power due to the limitation of dynamic range of Analog to Digital Converter and Digital to Analog Converter (ADC/DAC and power amplifiers at the transmitter, which in turn sets the limit over maximum achievable rate.This issue is especially important for mobile terminals to sustain longer battery life time. Therefore reducing PAPR can be regarded as an important issue to realize efficient and affordable mobile communication services.This paper presents an efficient PAPR reduction method for OFDM signal. This method is based on clipping and iterative processing. Iterative processing is performed to limit PAPR in time domain but the subtraction process of the peak that over PAPR threshold with the original signal is done in frequency domain, not in time like usual clipping technique. The results of this method is capable of reducing the PAPR significantly with minimum bit error rate (BER degradation.

  10. An iterative method to compute the overlap Dirac operator at nonzero chemical potential

    CERN Document Server

    Bloch, J; Lang, B; Wettig, T

    2007-01-01

    The overlap Dirac operator at nonzero quark chemical potential involves the computation of the sign function of a non-Hermitian matrix. In this talk we present an iterative method, first proposed by us in Ref. [1], which allows for an efficient computation of the operator, even on large lattices. The starting point is a Krylov subspace approximation, based on the Arnoldi algorithm, for the evaluation of a generic matrix function. The efficiency of this method is spoiled when the matrix has eigenvalues close to a function discontinuity. To cure this, a small number of critical eigenvectors are added to the Krylov subspace, and two different deflation schemes are proposed in this augmented subspace. The ensuing method is then applied to the sign function of the overlap Dirac operator, for two different lattice sizes. The sign function has a discontinuity along the imaginary axis, and the numerical results show how deflation dramatically improves the efficiency of the method.

  11. Doubly Periodic Wave Solutions of Janlent-Miodek Equations Using Variational Iteration Method Combined with Jacobian-function Method

    Institute of Scientific and Technical Information of China (English)

    FAN Hong-Yi; ZHU Jia-Min; WANG Tong-Tong; LU Zhi-Ming; LIU Yu-Lu

    2008-01-01

    One of the advantages of the variational iteration method is the free choice of initial guess. In this paper we use the basic idea of the Jacobian-function method to construct a generalized trial function with some unknown parameters. The Jaulent-Miodek equations are used to illustrate effectiveness and convenience of this method, some new explicit exact travelling wave solutions have been obtained, which include bell-type soliton solution, kink-type soliton solutions, solitary wave solutions, and doubly periodic wave solutions.

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

  13. Smart Charging of EVs in Residential Distribution Systems Using the Extended Iterative Method

    Directory of Open Access Journals (Sweden)

    Jian Zhang

    2016-11-01

    Full Text Available Smart charging of electrical vehicles (EVs is critical to provide the secure and cost-effective operation for distribution systems. Three model objective functions which are minimization of total supplied power, energy costs and maximization of profits are formulated. The conventional household load is modeled as a ZIP load that consists of constant power, constant current and constant impedance components. The imbalance of distribution system, constraints on nodal voltages and thermal loadings of lines and transformers are all taken into account. Utilizing the radial operation structure of distribution system, an extended iterative method is proposed to greatly reduce the dimensions of optimization variables and thus improve calculation speed. Impacts of the conventional household load model on the simulation results are also investigated. Case studies on three distribution systems with 2, 14, and 141 buses are performed and analyzed. It is found that the linear constrained convex quadratic programming model is applicable at each iteration, when the conventional household load is composed of constant power and constant impedance load. However, it is not applicable when the conventional household load consists of constant current load. The accuracy and computational efficiency of the proposed method are also validated.

  14. A non-iterative method for the electrical impedance tomography based on joint sparse recovery

    Science.gov (United States)

    Lee, Ok Kyun; Kang, Hyeonbae; Ye, Jong Chul; Lim, Mikyoung

    2015-07-01

    The purpose of this paper is to propose a non-iterative method for the inverse conductivity problem of recovering multiple small anomalies from the boundary measurements. When small anomalies are buried in a conducting object, the electric potential values inside the object can be expressed by integrals of densities with a common sparse support on the location of anomalies. Based on this integral expression, we formulate the reconstruction problem of small anomalies as a joint sparse recovery and present an efficient non-iterative recovery algorithm of small anomalies. Furthermore, we also provide a slightly modified algorithm to reconstruct an extended anomaly. We validate the effectiveness of the proposed algorithm over the linearized method and the multiple signal classification algorithm by numerical simulations. This work is supported by the Korean Ministry of Education, Sciences and Technology through NRF grant No. NRF-2010-0017532 (to H K), the Korean Ministry of Science, ICT & Future Planning; through NRF grant No. NRF-2013R1A1A3012931 (to M L), the R&D Convergence Program of NST (National Research Council of Science & Technology) of Republic of Korea (Grant CAP-13-3-KERI) (to O K L and J C Y).

  15. Iterative least square phase-measuring method that tolerates extended finite bandwidth illumination.

    Science.gov (United States)

    Munteanu, Florin; Schmit, Joanna

    2009-02-20

    Iterative least square phase-measuring techniques address the phase-shifting interferometry issue of sensitivity to vibrations and scanner nonlinearity. In these techniques the wavefront phase and phase steps are determined simultaneously from a single set of phase-shifted fringe frames where the phase shift does not need to have a nominal value or be a priori precisely known. This method is commonly used in laser interferometers in which the contrast of fringes is constant between frames and across the field. We present step-by-step modifications to the basic iterative least square method. These modifications allow for vibration insensitive measurements in an interferometric system in which fringe contrast varies across a single frame, as well as from frame to frame, due to the limited bandwidth light source and the nonzero numerical aperture of the objective. We demonstrate the efficiency of the new algorithm with experimental data, and we analyze theoretically the degree of contrast variation that this new algorithm can tolerate.

  16. An asymptotic preserving method for strongly anisotropic diffusion equations based on field line integration

    Science.gov (United States)

    Tang, Min; Wang, Yihong

    2017-02-01

    In magnetized plasma, the magnetic field confines the particles around the field lines. The anisotropy intensity in the viscosity and heat conduction may reach the order of 1012. When the boundary conditions are periodic or Neumann, the strong diffusion leads to an ill-posed limiting problem. To remove the ill-conditionedness in the highly anisotropic diffusion equations, we introduce a simple but very efficient asymptotic preserving reformulation in this paper. The key idea is that, instead of discretizing the Neumann boundary conditions locally, we replace one of the Neumann boundary condition by the integration of the original problem along the field line, the singular 1 / ɛ terms can be replaced by O (1) terms after the integration, which yields a well-posed problem. Small modifications to the original code are required and no change of coordinates nor mesh adaptation are needed. Uniform convergence with respect to the anisotropy strength 1 / ɛ can be observed numerically and the condition number does not scale with the anisotropy.

  17. The $r^{p}$-weighted energy method of Dafermos and Rodnianski in general asymptotically flat spacetimes and applications

    CERN Document Server

    Moschidis, Georgios

    2015-01-01

    In [M. Dafermos and I. Rodnianski, A new physical-space approach to decay for the wave equation with applications to black hole spacetimes, in XVIth International Congress on Mathematical Physics, Pavel Exner ed., Prague 2009 pp. 421-433, 2009, arXiv:0910.4957], Dafermos and Rodnianski presented a novel approach to establish uniform decay rates for solutions $\\phi$ to the scalar wave equation $\\square_{g}\\phi=0$ on Minkowski, Schwarzschild and other asymptotically flat backgrounds. This paper generalises the methods and results of the above paper to a broad class of asymptotically flat spacetimes $(\\mathcal{M},g)$, including Kerr spacetimes in the full subextremal range $|a|

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

    Energy Technology Data Exchange (ETDEWEB)

    Yusufoglu, Elcin [Dumlupinar University, Art-Science Faculty, Department of Mathematics, 43100 Kuetahya (Turkey)], E-mail: eyusufoglu@dumlupinar.edu.tr; Erbas, Baris [Anadolu University, Department of Mathematics, Yunus Emre Campus, 26470 Eskisehir (Turkey)

    2008-05-19

    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.

  19. Couple of the Variational Iteration Method and Legendre Wavelets for Nonlinear Partial Differential Equations

    Directory of Open Access Journals (Sweden)

    Fukang Yin

    2013-01-01

    Full Text Available This paper develops a modified variational iteration method coupled with the Legendre wavelets, which can be used for the efficient numerical solution of nonlinear partial differential equations (PDEs. The approximate solutions of PDEs are calculated in the form of a series whose components are computed by applying a recursive relation. Block pulse functions are used to calculate the Legendre wavelets coefficient matrices of the nonlinear terms. The main advantage of the new method is that it can avoid solving the nonlinear algebraic system and symbolic computation. Furthermore, the developed vector-matrix form makes it computationally efficient. The results show that the proposed method is very effective and easy to implement.

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

  1. Application of an iterative method and an evolutionary algorithm in fuzzy optimization

    Directory of Open Access Journals (Sweden)

    Ricardo Coelho Silva

    2012-08-01

    Full Text Available This work develops two approaches based on the fuzzy set theory to solve a class of fuzzy mathematical optimization problems with uncertainties in the objective function and in the set of constraints. The first approach is an adaptation of an iterative method that obtains cut levels and later maximizes the membership function of fuzzy decision making using the bound search method. The second one is a metaheuristic approach that adapts a standard genetic algorithm to use fuzzy numbers. Both approaches use a decision criterion called satisfaction level that reaches the best solution in the uncertain environment. Selected examples from the literature are presented to compare and to validate the efficiency of the methods addressed, emphasizing the fuzzy optimization problem in some import-export companies in the south of Spain.

  2. Preconditioned Iterative Methods for Algebraic Systems from Multiplicative Half-Quadratic Regularization Image Restorations

    Institute of Scientific and Technical Information of China (English)

    Zhong-Zhi; Yu-Mei; K.

    2010-01-01

    Image restoration is often solved by minimizing an energy function consisting of a data-fidelity term and a regularization term. A regularized convex term can usually preserve the image edges well in the restored image. In this paper, we consider a class of convex and edge-preserving regularization functions, I.e., multiplicative half-quadratic regularizations, and we use the Newton method to solve the correspondingly reduced systems of nonlinear equations. At each Newton iterate, the preconditioned conjugate gradient method, incorporated with a constraint preconditioner, is employed to solve the structured Newton equation that has a symmetric positive definite coefficient matrix.The igenvalue bounds of the preconditioned matrix are deliberately derived, which can be used to estimate the convergence speed of the preconditioned conjugate gradient method. We use experimental results to demonstrate that this new approach is efficient,and the effect of image restoration is r0easonably well.

  3. A non-linear iterative method for multi-layer DOT sub-surface imaging system.

    Science.gov (United States)

    Hou, Hsiang-Wen; Wu, Shih-Yang; Sun, Hao-Jan; Fang, Wai-Chi

    2014-01-01

    Diffuse Optical Tomography (DOT) has become an emerging non-invasive technology, and has been widely used in clinical diagnosis. Functional near-infrared (FNIR) is one of the important applications of DOT. However, FNIR is used to reconstruct two-dimensional (2D) images for the sake of good spatial and temporal resolution. In this paper we propose a multiple-input and multiple-output (MIMO) based data extraction algorithm method in order to increase the spatial and temporal resolution. The non-linear iterative method is used to reconstruct better resolution images layer by layer. In terms of theory, the simulation results and original images are nearly identical. The proposed reconstruction method performs good spatial resolution, and has a depth resolutions capacity of three layers.

  4. Unfolding the measured neutron spectra in the irradiation chamber of the UZrH reactor using iterative method

    Institute of Scientific and Technical Information of China (English)

    2007-01-01

    In the procedure of neutron fluence measurement in the whole energy range (10-4 eV~18 MeV), in the irradiation chamber of a UZrH reactor, the neutron energy spectra are unfolded using the method of minimizing directed divergence and SAND-Ⅱ, which are used broadly at home and abroad. These methods belong to the iterative methods.In this article, the procedure of the spectra unfolding using the two methods is described in detail. The neutron spectrum distribution unfolded by the two methods agree well with each other. In the end, the major differences of the two iterative methods are compared with each other, and the main factors affecting the accuracy of the spectra unfolding with the iterative method are discussed.

  5. Analytical Solutions for the Equilibrium states of a Swollen Hydrogel Shell and an Extended Method of Matched Asymptotics

    CERN Document Server

    Dai, Hui-Hui

    2011-01-01

    A polymer network can imbibe water, forming an aggregate called hydrogel, and undergo large and inhomogeneous deformation with external mechanical constraint. Due to the large deformation, nonlinearity plays a crucial role, which also causes the mathematical difficulty for obtaining analytical solutions. Based on an existing model for equilibrium states of a swollen hydrogel with a core-shell structure, this paper seeks analytical solutions of the deformations by perturbation methods for three cases, i.e. free-swelling, nearly free-swelling and general inhomogeneous swelling. Particularly for the general inhomogeneous swelling, we introduce an extended method of matched asymptotics to construct the analytical solution of the governing nonlinear second-order variable-coefficient differential equation. The analytical solution captures the boundary layer behavior of the deformation. Also, analytical formulas for the radial and hoop stretches and stresses are obtained at the two boundary surfaces of the shell, ma...

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

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

    Institute of Scientific and Technical Information of China (English)

    Luo Delin; Xie Rongzeng; Duan Haibin

    2014-01-01

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

  8. Beam hardening and motion artifacts in cardiac CT: evaluation and iterative correction method

    Science.gov (United States)

    Shen, Zeyang; Lee, Okkyun; Taguchi, Katsuyuki

    2016-03-01

    For myocardial perfusion CT exams, beam hardening (BH) artifacts may degrade the accuracy of myocardial perfusion defect detection. Meanwhile, cardiac motion may make BH process inconsistent, which makes conventional BH correction (BHC) methods ineffective. The aims of this study were to assess the severity of BH artifacts and motion artifacts and propose a projection-based iterative BHC method which has a potential to handle the motion-induced inconsistency better than conventional methods. In this study, four sets of forward projection data were first acquired using both cylindrical phantoms and cardiac images as objects: (1) with monochromatic x-rays without motion; (2) with polychromatic x-rays without motion; (3) with monochromatic x-rays with motion; and (4) with polychromatic x-rays with motion. From each dataset, images were reconstructed using filtered back projection; for datasets 2 and 4, one of the following BHC methods was also performed: (A) no BHC; (B) BHC that concerns water only; and (C) BHC that takes both water and iodine into account, which is an iterative method we developed in this work. Biases of images were quantified by the mean absolute difference (MAD). The MAD of images with BH artifacts alone (dataset 2, without BHC) was comparable or larger than that of images with motion artifacts alone (dataset 3): In the study of cardiac image, BH artifacts account for over 80% of the total artifacts. The use of BHC was effective: with dataset 4, MAD values were 170 HU with no BHC, 54 HU with water BHC, and 42 HU with the proposed BHC. Qualitative improvements in image quality were also noticeable in reconstructed images.

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

  10. Iterating skeletons

    DEFF Research Database (Denmark)

    Dieterle, Mischa; Horstmeyer, Thomas; Berthold, Jost;

    2012-01-01

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

  11. A new iterative method for liver segmentation from perfusion CT scans

    Science.gov (United States)

    Draoua, Ahmed; Albouy-Kissi, Adélaïde; Vacavant, Antoine; Sauvage, Vincent

    2014-03-01

    Liver cancer is the third most common cancer in the world, and the majority of patients with liver cancer will die within one year as a result of the cancer. Liver segmentation in the abdominal area is critical for diagnosis of tumor and for surgical procedures. Moreover, it is a challenging task as liver tissue has to be separated from adjacent organs and substantially the heart. In this paper we present a novel liver segmentation iterative method based on Fuzzy C-means (FCM) coupled with a fast marching segmentation and mutual information. A prerequisite for this method is the determination of slice correspondences between ground truth that is, a few images segmented by an expert, and images that contain liver and heart at the same time.

  12. Application of Gauss's law space-charge limited emission model in iterative particle tracking method

    Science.gov (United States)

    Altsybeyev, V. V.; Ponomarev, V. A.

    2016-11-01

    The particle tracking method with a so-called gun iteration for modeling the space charge is discussed in the following paper. We suggest to apply the emission model based on the Gauss's law for the calculation of the space charge limited current density distribution using considered method. Based on the presented emission model we have developed a numerical algorithm for this calculations. This approach allows us to perform accurate and low time consumpting numerical simulations for different vacuum sources with the curved emitting surfaces and also in the presence of additional physical effects such as bipolar flows and backscattered electrons. The results of the simulations of the cylindrical diode and diode with elliptical emitter with the use of axysimmetric coordinates are presented. The high efficiency and accuracy of the suggested approach are confirmed by the obtained results and comparisons with the analytical solutions.

  13. An iterative regularization method for the solution of the split feasibility problem in Banach spaces

    Science.gov (United States)

    Schöpfer, F.; Schuster, T.; Louis, A. K.

    2008-10-01

    The split feasibility problem (SFP) consists of finding a common point in the intersection of finitely many convex sets, where some of the sets arise by imposing convex constraints in the range of linear operators. We are concerned with its solution in Banach spaces. To this end we generalize the CQ algorithm of Byrne with Bregman and metric projections to obtain an iterative solution method. In case the sets projected onto are contaminated with noise we show that a discrepancy principle renders this algorithm a regularization method. We measure the distance between convex sets by local versions of the Hausdorff distance, which in contrast to the standard Hausdorff distance allow us to measure the distance between unbounded sets. Hereby we prove a uniform continuity result for both kind of projections. The performance of the algorithm is demonstrated with some numerical experiments.

  14. Complex Mode Frequency Iteration Method for Flutter Analysis of 2-DOF Systems

    Institute of Scientific and Technical Information of China (English)

    2001-01-01

    For a vibration system with 2-DOF of bend and torsion, itscritical flutter wind speed can be calculated by using complex mode frequency iteration (CMFI) method based on MatLab 5.2, the results of which are in agree with those acquired by wind tunnel test. Not only critical flutter wind speed, but also vibration characteristic of a system under different wind speeds can be determined. CMFI method is suitable for both of separated-flow torsional flutter and classic coupling flutter analysis, which is presented by flutter analysis of an ideal thin plate and a bluff bridge deck. Furthermore, it is proved through the investigation of the relationship between flutter derivatives and its critical flutter wind speed that coupling aerodynamic derivatives are necessary for classic coupling flutter to occur.

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

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

  17. Asymptotic Evolution of Random Unitary Operations

    CERN Document Server

    Novotny, J; Jex, I

    2009-01-01

    We analyze the asymptotic dynamics of quantum systems resulting from large numbers of iterations of random unitary operations. Although, in general, these quantum operations cannot be diagonalized it is shown that their resulting asymptotic dynamics is described by a diagonalizable superoperator. We prove that this asymptotic dynamics takes place in a typically low dimensional attractor space which is independent of the probability distribution of the unitary operations applied. This vector space is spanned by all eigenvectors of the unitary operations involved which are associated with eigenvalues of unit modulus. Implications for possible asymptotic dynamics of iterated random unitary operations are presented and exemplified in an example involving random controlled-not operations acting on two qubits.

  18. Applications of a direct/iterative design method to complex transonic configurations

    Science.gov (United States)

    Smith, Leigh Ann; Campbell, Richard L.

    1992-01-01

    The current study explores the use of an automated direct/iterative design method for the reduction of drag in transport configurations, including configurations with engine nacelles. The method requires the user to choose a proper target-pressure distribution and then develops a corresponding airfoil section. The method can be applied to two-dimensional airfoil sections or to three-dimensional wings. The three cases that are presented show successful application of the method for reducing drag from various sources. The first two cases demonstrate the use of the method to reduce induced drag by designing to an elliptic span-load distribution and to reduce wave drag by decreasing the shock strength for a given lift. In the second case, a body-mounted nacelle is added and the method is successfully used to eliminate increases in wing drag associated with the nacelle addition by designing to an arbitrary pressure distribution as a result of the redesigning of a wing in combination with a given underwing nacelle to clean-wing, target-pressure distributions. These cases illustrate several possible uses of the method for reducing different types of drag. The magnitude of the obtainable drag reduction varies with the constraints of the problem and the configuration to be modified.

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

  20. The development of in-situ calibration method for divertor IR thermography in ITER

    Energy Technology Data Exchange (ETDEWEB)

    Takeuchi, M.; Sugie, T.; Ogawa, H.; Takeyama, S.; Itami, K. [Japan Atomic Energy Agency (Japan)

    2014-08-21

    For the development of the calibration method of the emissivity in IR light on the divertor plate in ITER divertor IR thermography system, the laboratory experiments have been performed by using IR instruments. The calibration of the IR camera was performed by the plane black body in the temperature of 100–600 degC. The radiances of the tungsten heated by 280 degC were measured by the IR camera without filter (2.5–5.1 μm) and with filter (2.95 μm, 4.67 μm). The preliminary data of the scattered light of the laser of 3.34 μm that injected into the tungsten were acquired.

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

  2. A distributed inverse iteration method for eigenvalue analysis of interconnected power systems

    Institute of Scientific and Technical Information of China (English)

    SHEN; Chen; CHEN; Ying; ZHANG; Xu

    2007-01-01

    Since China power grids have a hierarchical architecture in operation and management, centralized computation patterns are difficult to meet the demands of small-signal-stability analysis of the bulk interconnected power systems. A distributed eigenvalue algorithm derived from the inverse iteration method is proposed. It can not only obtain eigenvalues and eigenvectors from power system state matrix but also provide participation factors of all generators. In the computing process, the algorithm only requires exchanging data of boundary nodes and a small amount of other information of different regions. Therefore, it is very suitable to be deployed in a WAN (wide area network) based distributed environment. The algorithm has been tested on an IEEE39 system.

  3. An Iterative Method for the Construction of Equilibrium N-Body Models for Stellar Disks

    CERN Document Server

    Rodionov, S A

    2006-01-01

    One widely used technique for the construction of equilibrium models of stellar disks is based on the Jeans equations and the moments of velocity distribution functions derived using these equations. Stellar disks constructed using this technique are shown to be "not entirely" in equilibrium. Our attempt to abandon the epicyclic approximation and the approximation of infinite isothermal layers, which are commonly adopted in this technique, failed to improve the situation substantially. We conclude that the main drawback of techniques based on the Jeans equations is that the system of equations employed is not closed, and therefore requires adopting an essentially ad hoc additional closure condition. A new iterative approach to constructing equilibrium N-body models with a given density distribution is proposed. The main idea behind this approach is that a model is first constructed using some approximation method, and is then allowed to adjust to an equilibrium state with the specified density and the require...

  4. Adaptive and Iterative Methods for Simulations of Nanopores with the PNP-Stokes Equations

    CERN Document Server

    Mitscha-Baude, Gregor; Tulzer, Gerhard; Heitzinger, Clemens

    2016-01-01

    We present a 3D finite element solver for the nonlinear Poisson-Nernst-Planck (PNP) equations for electrodiffusion, coupled to the Stokes system of fluid dynamics. The model serves as a building block for the simulation of macromolecule dynamics inside nanopore sensors. We add to existing numerical approaches by deploying goal-oriented adaptive mesh refinement. To reduce the computation overhead of mesh adaptivity, our error estimator uses the much cheaper Poisson-Boltzmann equation as a simplified model, which is justified on heuristic grounds but shown to work well in practice. To address the nonlinearity in the full PNP-Stokes system, three different linearization schemes are proposed and investigated, with two segregated iterative approaches both outperforming a naive application of Newton's method. Numerical experiments are reported on a real-world nanopore sensor geometry. We also investigate two different models for the interaction of target molecules with the nanopore sensor through the PNP-Stokes equ...

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

  6. Fourier transform based iterative method for x-ray differential phase-contrast computed tomography

    CERN Document Server

    Cong, Wenxiang; Wang, Ge

    2011-01-01

    Biological soft tissues encountered in clinical and pre-clinical imaging mainly consist of light element atoms, and their composition is nearly uniform with little density variation. Thus, x-ray attenuation imaging suffers from low image contrast resolution. By contrast, x-ray phase shift of soft tissues is about a thousand times greater than x-ray absorption over the diagnostic energy range, thereby a significantly higher sensitivity can be achieved in terms of phase shift. In this paper, we propose a novel Fourier transform based iterative method to perform x-ray tomographic imaging of the refractive index directly from differential phase shift data. This approach offers distinct advantages in cases of incomplete and noisy data than analytic reconstruction, and especially suitable for phase-contrast interior tomography by incorporating prior knowledge in a region of interest (ROI). Biological experiments demonstrate the merits of the proposed approach.

  7. Fully Implicit Iterative Solving Method for the Fokker-Planck Equation in Tokamak Plasmas

    Institute of Scientific and Technical Information of China (English)

    ZHENG Pingwei; GONG Xueyu; YU Jun; DU Dan

    2014-01-01

    A three dimensional bounce-averaged Fokker-Planck (FP) numerical code has been newly developed based on fully implicit iterative solving method,and relativistic effect is also included in the code.The code has been tested against various benchmark cases:Ohmic conductivity in the presence of weak Ohmic electric field,runaway losses of electrons in the presence of strong Ohmic electric field,lower hybrid current drive and electron cyclotron current drive via two-or three-dimensional simulation.All the test cases run fast and correctly during calculations.As a result,the code provides a set of powerful tools for studying radio frequency wave heating and current drive in tokamak plasmas.

  8. 一致凸Banach空间中渐近非扩展映象的迭代格式之新强收敛定理%Some New Strong Convergence Theorems for Iterative Schemes for Asymptotically Nonexpansive Mappings in Uniformly Convex Banach Spaces

    Institute of Scientific and Technical Information of China (English)

    周海云; 高改良; 陈东青

    2003-01-01

    In the present paper, by virtue of new analysis technique, we have established a new strong convergence theorem for the modified Mann iteration scheme for a class of asymptotically nonexpansive mappings in uniformly convex Banach spaces. Our results improve the recent ones announced by Schu, Rhoades and others.%通过使用新的分析技巧,建立了(关于)渐近非扩展映象的修正的迭代格式的强收敛定理.所得结果改进了Schu,Rhoades以及其他作者相关的结果.

  9. The Use of Iterative Methods to Solve Two-Dimensional Nonlinear Volterra-Fredholm Integro-Differential Equations

    Directory of Open Access Journals (Sweden)

    shadan sadigh behzadi

    2012-03-01

    Full Text Available In this present paper, we solve a two-dimensional nonlinear Volterra-Fredholm integro-differential equation by using the following powerful, efficient but simple methods: (i Modified Adomian decomposition method (MADM, (ii Variational iteration method (VIM, (iii Homotopy analysis method (HAM and (iv Modified homotopy perturbation method (MHPM. The uniqueness of the solution and the convergence of the proposed methods are proved in detail. Numerical examples are studied to demonstrate the accuracy of the presented methods.

  10. A FAST ITERATIVE METHOD FOR SOLVING THE EIKONAL EQUATION ON TRIANGULATED SURFACES.

    Science.gov (United States)

    Fu, Zhisong; Jeong, Won-Ki; Pan, Yongsheng; Kirby, Robert M; Whitaker, Ross T

    2011-01-01

    This paper presents an efficient, fine-grained parallel algorithm for solving the Eikonal equation on triangular meshes. The Eikonal equation, and the broader class of Hamilton-Jacobi equations to which it belongs, have a wide range of applications from geometric optics and seismology to biological modeling and analysis of geometry and images. The ability to solve such equations accurately and efficiently provides new capabilities for exploring and visualizing parameter spaces and for solving inverse problems that rely on such equations in the forward model. Efficient solvers on state-of-the-art, parallel architectures require new algorithms that are not, in many cases, optimal, but are better suited to synchronous updates of the solution. In previous work [W. K. Jeong and R. T. Whitaker, SIAM J. Sci. Comput., 30 (2008), pp. 2512-2534], the authors proposed the fast iterative method (FIM) to efficiently solve the Eikonal equation on regular grids. In this paper we extend the fast iterative method to solve Eikonal equations efficiently on triangulated domains on the CPU and on parallel architectures, including graphics processors. We propose a new local update scheme that provides solutions of first-order accuracy for both architectures. We also propose a novel triangle-based update scheme and its corresponding data structure for efficient irregular data mapping to parallel single-instruction multiple-data (SIMD) processors. We provide detailed descriptions of the implementations on a single CPU, a multicore CPU with shared memory, and SIMD architectures with comparative results against state-of-the-art Eikonal solvers.

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

  12. Convergence of Ishikawa Iterative Scheme with Errors for Finite Families of Asymptotically Nonexpansive Non-self Mappings%有限个渐进非扩张非自映射的带有误差的Ishikawa迭代的收敛性

    Institute of Scientific and Technical Information of China (English)

    王德珍; 邓磊

    2008-01-01

    In this paper, we introduce Ishikawa iterative scheme with errors for finite families of asymptotically nonexpansive non-self mappings and prove the strong convergence of the Ishikawa iterative scheme with errors in a uniformly convex Banach space under a new condition. The results presented in this paper extend and improve recently known results in the literature.%介绍了有限个渐进非扩张非自映射的带有误差的Ishikawa迭代, 并且证明了在一致凸Banach空间中这种带有误差的Ishikawa迭代在一个新的条件下的强收敛性.

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

  14. Iterative methods for obtaining solvation structures on a solid plate: The methods for Surface Force Apparatus and Atomic Force Microscopy in Liquids

    CERN Document Server

    Amano, Ken-ich

    2013-01-01

    We propose iterative methods for obtaining solvation structures on a solid plate which use force distributions measured by surface force apparatus (SFA) and atomic force microscopy (AFM) as input data. Two model systems are considered here. In the model system for SFA, the same two solid plates are immersed in a solvent, and a probe tip and a solid plate are immersed in a solvent in the model system for AFM. Advantages of the iterative methods are as follows: The iterative method for SFA can obtain the solvation structure, for example, in a Lennard-Jones liquid; The iterative method for AFM can obtain the solvation structure without an input datum of solvation structure around the probe tip.

  15. CONVERGENCE OF INNER ITERATIONS SCHEME OF THE DISCRETE ORDINATE METHOD IN SPHERICAL GEOMETRY

    Institute of Scientific and Technical Information of China (English)

    Zhi-jun Shen; Guang-wei Yuan; Long-jun Shen

    2005-01-01

    In transport theory, the convergence of the inner iteration scheme to the spherical neutron transport equation has been an open problem. In this paper, the inner iteration for a positive step function scheme is considered and its convergence in spherical geometry is proved.

  16. Low-rank approximations with sparse factors II: Penalized methods with discrete Newton-like iterations

    Energy Technology Data Exchange (ETDEWEB)

    Zhang, Zhenyue [Zhejiang Univ., Hangzhou (People' s Republic of China); Zha, Hongyuan [Pennsylvania State Univ., University Park, PA (United States); Simon, Horst [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States)

    2006-07-31

    In this paper, we developed numerical algorithms for computing sparse low-rank approximations of matrices, and we also provided a detailed error analysis of the proposed algorithms together with some numerical experiments. The low-rank approximations are constructed in a certain factored form with the degree of sparsity of the factors controlled by some user-specified parameters. In this paper, we cast the sparse low-rank approximation problem in the framework of penalized optimization problems. We discuss various approximation schemes for the penalized optimization problem which are more amenable to numerical computations. We also include some analysis to show the relations between the original optimization problem and the reduced one. We then develop a globally convergent discrete Newton-like iterative method for solving the approximate penalized optimization problems. We also compare the reconstruction errors of the sparse low-rank approximations computed by our new methods with those obtained using the methods in the earlier paper and several other existing methods for computing sparse low-rank approximations. Numerical examples show that the penalized methods are more robust and produce approximations with factors which have fewer columns and are sparser.

  17. Asymptotic and Numerical Methods for Singularly Perturbed Differential Equations with Applications to Impact Problems.

    Science.gov (United States)

    1986-05-19

    eary and identify by block number) We developed and applied numerical methods for singularly perturbed two-point boundary value problems and time...Numerical Methods for Singularly Perturbed Differential Equations During the period of this contract. we developed and applied numerical methods for

  18. Convergence analysis and numerical study of a fixed-point iterative method for solving systems of nonlinear equations.

    Science.gov (United States)

    Huang, Na; Ma, Changfeng

    2014-01-01

    We present a fixed-point iterative method for solving systems of nonlinear equations. The convergence theorem of the proposed method is proved under suitable conditions. In addition, some numerical results are also reported in the paper, which confirm the good theoretical properties of our approach.

  19. On the effects of using the GTH method in the iterative-aggregation disaggregation technique

    Energy Technology Data Exchange (ETDEWEB)

    Dayar, T.; Stewart, W.J. [North Carolina State Univ., Raleigh, NC (United States)

    1994-12-31

    The iterative aggregation-disaggregation (IAD) technique is an effective method for solving finite nearly completely decomposable (NCD) Markov chains. Small perturbations in the transition probabilities of these chains lead to a considerable change in the stationary vector. Therefore, NCD Markov chains are referred to as being ill-conditioned. During an IAD step, this undesirable condition is inherited by the coupling matrix and one confronts the problem of finding the stationary vector of a stochastic matrix which has weighty diagonal elements close to one. In this paper, the authors investigate the effects of using the Grassmann-Taksar-Heyman (GTH) method to solve the coupling matrix formed in the aggregation step. Then, they extend the idea in such a way that this direct method can be incorporated into the disaggregation step. Finally, they discuss various implementation issues, demonstrate the effect of using the GTH method in the IAD algorithm on various examples, and elaborate on the conditions under which it should be applied.

  20. A fast iterative-clique percolation method for identifying functional modules in protein interaction networks

    Institute of Scientific and Technical Information of China (English)

    Penggang SUN; Lin GAO

    2009-01-01

    Accumulating evidence suggests that biological systems are composed of interacting, separable, functional modules-groups of vertices within which connections are dense but between which they are sparse. Identifying these modules is likely through capturing the biologically mean-ingful interactions. In recent years, many algorithms have been developed for detecting such structures. These al-gorithms, however, are computationally demanding, which limits their applications. In this paper, we propose a fast iterative-clique percolation method (ICPM) for identifying overlapping functional modules in protein-protein interac-tion (PPI) networks. Our method is based on clique percola-tion method (CPM), and it not only considers the degree of nodes to minimize the search space (the vertices in k-cliques must have the degree of k - 1 at least), but also converts k-cliques to (k - 1)-cliques. It finds k-cliques by append-ing one node to (k - 1)-cliques. By testing our method on PPI networks, our analysis of the yeast PPI network suggeststhat most of these modules have well-supported biological significance.

  1. Active Optimal Control of the KdV Equation Using the Variational Iteration Method

    Directory of Open Access Journals (Sweden)

    Ismail Kucuk

    2010-01-01

    Full Text Available The optimal pointwise control of the KdV equation is investigated with an objective of minimizing a given performance measure. The performance measure is specified as a quadratic functional of the final state and velocity functions along with the energy due to open- and closed-loop controls. The minimization of the performance measure over the controls is subjected to the KdV equation with periodic boundary conditions and appropriate initial condition. In contrast to standard optimal control or variational methods, a direct control parameterization is used in this study which presents a distinct approach toward the solution of optimal control problems. The method is based on finite terms of Fourier series approximation of each time control variable with unknown Fourier coefficients and frequencies. He's variational iteration method for the nonlinear partial differential equations is applied to the problem and thus converting the optimal control of lumped parameter systems into a mathematical programming. A numerical simulation is provided to exemplify the proposed method.

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

  3. Asymptotic Analysis to Two Nonlinear Equations in Fluid Mechanics by Homotopy Renormalisation Method

    Science.gov (United States)

    Guan, Jiang; Kai, Yue

    2016-09-01

    By the homotopy renormalisation method, the global approximate solutions to Falkner-Skan equation and Von Kármá's problem of a rotating disk in an infinite viscous fluid are obtained. The homotopy renormalisation method is simple and powerful for finding global approximate solutions to nonlinear perturbed differential equations arising in mathematical physics.

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

  5. 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....... The argument involves theory for a new class of weighted and marked empirical processes, quantile process theory, and a fixed point argument to describe the iterative element of the procedure....

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

  7. A New Optical Surface Measurement Method with Iterative Sparsity-Constrained Threshold Phase Retrieval Algorithm

    Directory of Open Access Journals (Sweden)

    Yi Niu

    2014-01-01

    Full Text Available Due to its low complexity and acceptable accuracy, phase retrieval technique has been proposed as an alternative to solve the classic optical surface measurement task. However, to capture the overall wave field, phase retrieval based optical surface measurement (PROSM system has to moderate the CCD position during the multiple-sampling procedure. The mechanical modules of CCD movement may bring about unexpectable deviation to the final results. To overcome this drawback, we propose a new PROSM method based on spatial light modulator (SLM. The mechanical CCD movement can be replaced by an electrical moderation of SLM patterns; thus the deviation can be significantly suppressed in the new PROSM method. In addition, to further improve the performance, we propose a new iterative threshold phase retrieval algorithm with sparsity-constraint to effectively reconstruct the phase of wave field. Experimental results show that the new method provides a more simple and robust solution for the optical surface measurement than the traditional techniques and achieves higher accuracy.

  8. 一致凸Banach空间(L-α)一致李普希兹渐进非扩张映射的不动点迭代问题%Fixed-point Iteration for (L - α) Uniform Lipschitz Asymptotically Nonexpansive Mapping of Uniform Convex Banach Space

    Institute of Scientific and Technical Information of China (English)

    王娴; 何震

    2004-01-01

    Xu和Norr已经证明了建立在一致凸Banach空间的一个非空有界闭凸子集上的渐进非扩张映射的三步迭代的收敛定理问题.引入(L-α)一致李普希兹的概念,然后在一些已有结果的基础上,证明一致凸Banach空间的紧子集上的(L-α)一致李普希兹渐进非扩张映射的三步迭代序列的收敛问题.这个结论是对Xu和Noor的相应结果的推广.%Xu and Noor had proved the theorem on convergence of three-step iterations for asymptotically nonexpansive mapping on nonempty closed, bounded, and convex subset of uniformly convex Banach space. Based on some results given by K Tan and H K Xu[1] proved, the convergence of three-step iterations of (L-α) uniformly Lipschitz asymptotically nonexpansive mapping on a compact subset of a uniform convex Banach space had proved. The results presented extended the corresponding of Xu and Noor[5].

  9. An iterative virtual projection method to improve the reconstruction performance for ill-posed emission tomographic problems

    Institute of Scientific and Technical Information of China (English)

    柳华蔚; 郑树; 周怀春

    2015-01-01

    In order to improve the reconstruction performance for ill-posed emission tomographic problems with limited projec-tions, a generalized interpolation method is proposed in this paper, in which the virtual lines of projection are fabricated from, but not linearly dependent on, the measured projections. The method is called the virtual projection (VP) method. Also, an iterative correction method for the integral lengths is proposed to reduce the error brought about by the virtual lines of projection. The combination of the two methods is called the iterative virtual projection (IVP) method. Based on a scheme of equilateral triangle plane meshes and a six asymmetrically arranged detection system, numerical simulations and experimental verification are conducted. Simulation results obtained by using a non-negative linear least squares method, without any other constraints or regularization, demonstrate that the VP method can gradually reduce the reconstruction error and converges to the desired one by fabricating additional effective projections. When the mean square deviation of normal error superimposed on the simulated measured projections is smaller than 0.03, i.e., the signal-to-noise ratio (SNR) for the measured projections is higher than 30.4, the IVP method can further reduce the reconstruction error reached by the VP method apparently. In addition, as the regularization matrix in the Tikhonov regularization method is updated by an iterative correction process similar to the IVP method presented in this paper, or the Tikhonov regularization method is used in the IVP method, good improvement is achieved.

  10. Static and dynamic pull-in instability of multi-walled carbon nanotube probes by He's iteration perturbation method

    Energy Technology Data Exchange (ETDEWEB)

    Sedighi, Hamid M. [Shahid Chamran University of Ahvaz (Iran, Islamic Republic of); Daneshmand, Farhang [Mcgill University, Quebec (Canada)

    2014-09-15

    A continuum model is utilized to extract the nonlinear governing equation for Carbon nanotube (CNT) probes near graphite sheets. The van der Waals (vdW) intermolecular force and electrostatic actuation are included in the equation of motion. Static and dynamic pull-in behavior of the system is investigated in this paper. To this end, a new asymptotic procedure is presented to predict the pull-in instability of electrically actuated CNTs by employing an analytic approach namely He's iteration perturbation method (IPM). The effects of basic non-dimensional parameters such as initial amplitude, intermolecular force, geometrical parameter and actuation voltage on the pull-in instability as well as the fundamental frequency are studied. The obtained results from numerical simulations by employing three mode assumptions verify the strength of the analytical procedure. The qualitative analysis of the system dynamics shows that the equilibrium points of the autonomous system include stable center points and unstable saddle nodes. The phase portraits of the carbon nanotube actuator exhibit periodic and homoclinic orbits.

  11. On the asymptotics of the α-Farey transfer operator

    Science.gov (United States)

    Kautzsch, J.; Kesseböhmer, M.; Samuel, T.; Stratmann, B. O.

    2015-01-01

    We study the asymptotics of iterates of the transfer operator for non-uniformly hyperbolic α-Farey maps. We provide a family of observables which are Riemann integrable, locally constant and of bounded variation, and for which the iterates of the transfer operator, when applied to one of these observables, is not asymptotic to a constant times the wandering rate on the first element of the partition α. Subsequently, sufficient conditions on observables are given under which this expected asymptotic holds. In particular, we obtain an extension theorem which establishes that, if the asymptotic behaviour of iterates of the transfer operator is known on the first element of the partition α, then the same asymptotic holds on any compact set bounded away from the indifferent fixed point.

  12. A practical method for estimating high-energy X-ray spectra using the iterative perturbation principle proposed by Waggener

    CERN Document Server

    Iwasaki, A; Kubota, M; Fujimori, A; Suzaki, K; Abe, Y

    2003-01-01

    We have remodeled the X-ray spectra estimation method, originally proposed by Waggener et al. (Med. Phys. 26(1999)1269), based on the iterative perturbation technique to minimize differences between measured and calculated transmission curves using low Z attenuators. With our approach, the iterative perturbation cycle is repeated until a reasonable spectrum is obtained. Furthermore, the degree of differences between the measured and calculated transmission curves is also checked using high Z attenuators. The present experimental study, conducted using 4, 10 and 15 MV X-ray beams from a linear accelerator, demonstrated that the spectrum varies strongly with the off-axis distance.

  13. 3D near-to-surface conductivity reconstruction by inversion of VETEM data using the distorted Born iterative method

    Science.gov (United States)

    Wang, G.L.; Chew, W.C.; Cui, T.J.; Aydiner, A.A.; Wright, D.L.; Smith, D.V.

    2004-01-01

    Three-dimensional (3D) subsurface imaging by using inversion of data obtained from the very early time electromagnetic system (VETEM) was discussed. The study was carried out by using the distorted Born iterative method to match the internal nonlinear property of the 3D inversion problem. The forward solver was based on the total-current formulation bi-conjugate gradient-fast Fourier transform (BCCG-FFT). It was found that the selection of regularization parameter follow a heuristic rule as used in the Levenberg-Marquardt algorithm so that the iteration is stable.

  14. High-resolution imaging without iteration: a fast and robust method for breast ultrasound tomography.

    Science.gov (United States)

    Huthwaite, P; Simonetti, F

    2011-09-01

    Breast ultrasound tomography has the potential to improve the cost, safety, and reliability of breast cancer screening and diagnosis over the gold-standard of mammography. Vital to achieving this potential is the development of imaging algorithms to unravel the complex anatomy of the breast and its mechanical properties. The solution most commonly relied upon is time-of-flight tomography, but this exhibits low resolution due to the presence of diffraction effects. Iterative full-wave inversion methods present one solution to achieve higher resolution, but these are slow and are not guaranteed to converge to the correct solution. Presented here is HARBUT, the hybrid algorithm for robust breast ultrasound tomography, which utilizes the complementary strengths of time-of-flight and diffraction tomography resulting in a direct, fast, robust and accurate high resolution method of reconstructing the sound speed through the breast. The algorithm is shown to produce accurate reconstructions with realistic data from a complex three-dimensional simulation, with masses as small as 4 mm being clearly visible.

  15. Type 2 Diabetes Biomarkers of Human Gut Microbiota Selected via Iterative Sure Independent Screening Method.

    Directory of Open Access Journals (Sweden)

    Lihua Cai

    Full Text Available Type 2 diabetes, which is a complex metabolic disease influenced by genetic and environment, has become a worldwide problem. Previous published results focused on genetic components through genome-wide association studies that just interpret this disease to some extent. Recently, two research groups published metagenome-wide association studies (MGWAS result that found meta-biomarkers related with type 2 diabetes. However, One key problem of analyzing genomic data is that how to deal with the ultra-high dimensionality of features. From a statistical viewpoint it is challenging to filter true factors in high dimensional data. Various methods and techniques have been proposed on this issue, which can only achieve limited prediction performance and poor interpretability. New statistical procedure with higher performance and clear interpretability is appealing in analyzing high dimensional data. To address this problem, we apply an excellent statistical variable selection procedure called iterative sure independence screening to gene profiles that obtained from metagenome sequencing, and 48/24 meta-markers were selected in Chinese/European cohorts as predictors with 0.97/0.99 accuracy in AUC (area under the curve, which showed a better performance than other model selection methods, respectively. These results demonstrate the power and utility of data mining technologies within the large-scale and ultra-high dimensional genomic-related dataset for diagnostic and predictive markers identifying.

  16. Iterative methods for solving coefficient inverse problems of wave tomography in models with attenuation

    Science.gov (United States)

    Goncharsky, Alexander V.; Romanov, Sergey Y.

    2017-02-01

    We develop efficient iterative methods for solving inverse problems of wave tomography in models incorporating both diffraction effects and attenuation. In the inverse problem the aim is to reconstruct the velocity structure and the function that characterizes the distribution of attenuation properties in the object studied. We prove mathematically and rigorously the differentiability of the residual functional in normed spaces, and derive the corresponding formula for the Fréchet derivative. The computation of the Fréchet derivative includes solving both the direct problem with the Neumann boundary condition and the reversed-time conjugate problem. We develop efficient methods for numerical computations where the approximate solution is found using the detector measurements of the wave field and its normal derivative. The wave field derivative values at detector locations are found by solving the exterior boundary value problem with the Dirichlet boundary conditions. We illustrate the efficiency of this approach by applying it to model problems. The algorithms developed are highly parallelizable and designed to be run on supercomputers. Among the most promising medical applications of our results is the development of ultrasonic tomographs for differential diagnosis of breast cancer.

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

  18. Subspace Iteration Method for Complex Eigenvalue Problems with Nonsymmetric Matrices in Aeroelastic System

    Science.gov (United States)

    Pak, Chan-gi; Lung, Shu

    2009-01-01

    Modern airplane design is a multidisciplinary task which combines several disciplines such as structures, aerodynamics, flight controls, and sometimes heat transfer. Historically, analytical and experimental investigations concerning the interaction of the elastic airframe with aerodynamic and in retia loads have been conducted during the design phase to determine the existence of aeroelastic instabilities, so called flutter .With the advent and increased usage of flight control systems, there is also a likelihood of instabilities caused by the interaction of the flight control system and the aeroelastic response of the airplane, known as aeroservoelastic instabilities. An in -house code MPASES (Ref. 1), modified from PASES (Ref. 2), is a general purpose digital computer program for the analysis of the closed-loop stability problem. This program used subroutines given in the International Mathematical and Statistical Library (IMSL) (Ref. 3) to compute all of the real and/or complex conjugate pairs of eigenvalues of the Hessenberg matrix. For high fidelity configuration, these aeroelastic system matrices are large and compute all eigenvalues will be time consuming. A subspace iteration method (Ref. 4) for complex eigenvalues problems with nonsymmetric matrices has been formulated and incorporated into the modified program for aeroservoelastic stability (MPASES code). Subspace iteration method only solve for the lowest p eigenvalues and corresponding eigenvectors for aeroelastic and aeroservoelastic analysis. In general, the selection of p is ranging from 10 for wing flutter analysis to 50 for an entire aircraft flutter analysis. The application of this newly incorporated code is an experiment known as the Aerostructures Test Wing (ATW) which was designed by the National Aeronautic and Space Administration (NASA) Dryden Flight Research Center, Edwards, California to research aeroelastic instabilities. Specifically, this experiment was used to study an instability

  19. On the asymptotic behaviour of a one-dimensional monocharged plasma and a rescaling method

    OpenAIRE

    Batt, Jürgen; Kunze, Markus; Rein, Gerhard

    1998-01-01

    We consider a one-dimensional, monocharged plasma as described by the Vlasov--Poisson system and investigate the behaviour of the solutions for large times. Using a rescaling method we are able to determine an explicit solution of the system which corresponds to a globally attractive steady state for the rescaled system. We investigate in which sense and at which rate the solutions of the rescaled system converge to this global attractor and interpret the results for the origin...

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

  1. The Davidon-Fletcher-Powell penalty function method: A generalized iterative technique for solving parameter optimization problems

    Science.gov (United States)

    Johnson, I. L., Jr.

    1976-01-01

    The Fletcher-Powell version of the Davidon variable metric unconstrained minimization technique is described. Equations that have been used successfully with the Davidon-Fletcher-Powell penalty function technique for solving constrained minimization problems and the advantages and disadvantages of using them are discussed. The experience gained in the behavior of the method while iterating is also related.

  2. 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...... and nonlinear problems. It is predicted that VIM can be widely applied in engineering....

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

  4. Iterating skeletons

    DEFF Research Database (Denmark)

    Dieterle, Mischa; Horstmeyer, Thomas; Berthold, Jost;

    2012-01-01

    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...... 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......-based iteration control, where both skeletons offer supportive type safety by dedicated types geared towards stream communication for the iteration. The skeleton iteration framework is implemented in the parallel Haskell dialect Eden. We use example applications to assess performance and overhead....

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

  6. A Fast Iterative Method for Chandrasekhar's H-functions for General Laws of Scattering

    CERN Document Server

    Kawabata, Kiyoshi

    2016-01-01

    This work shows that notable acceleration of the speed of calculating Chandrasekhar's H-functions for general laws of scattering with an iterative method can be realized by supplying a starting pproximation produced by the following procedure: (i) in the cases of azimuth-angle independent Fourier components, values of the isotropic scattering H-function given by an accurate yet simple-to-apply formula, in particular, the one by Kawabata and Limaye (Astrophys. and Space Sci. Vol. 332, 365-371, 2011 DOI 10.1007/s10509-010-0512-x; see also Astrophys. and Space Sci. Vol. 348, 601, 2013 DOI 10.1007/1009-013-1589-9, for erratum), and (ii) for azimuth-angle dependent Fourier components, an already obtained solution of the next lower order term. The paper has been published in Astrophys. and Space Sci. Vol. 358, 32-38 (2015) DOI 10.1007/s10509-015-2434-0, and the final publication is available at link.springer.com.

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

  8. Fake Review Detection From a Product Review Using Modified Method of Iterative Computation Framework

    Directory of Open Access Journals (Sweden)

    Wahyuni Eka Dyar

    2016-01-01

    Full Text Available The rapid growth of the Internet influenced many of our daily activities. One of the very rapid growth area is ecommerce. Generally e-commerce provide facility for customers to write reviews related with its service. The existence of these reviews can be used as a source of information. For examples, companies can use it to make design decisions of their products or services, while potential customers can use it to decide either to buy or to use a product. Unfortunately, the importance of the review is misused by certain parties who tried to create fake reviews, both aimed at raising the popularity or to discredit the product. This research aims to detect fake reviews for a product by using the text and rating property from a review. In short, the proposed system (ICF++ will measure the honesty value of a review, the trustiness value of the reviewers and the reliability value of a product. The honesty value of a review will be measured by utilizing the text mining and opinion mining techniques. The result from the experiment shows that the proposed system has a better accuracy compared with the result from iterative computation framework (ICF method.

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

  10. Demonstration of a forward iterative method to reconstruct brachytherapy seed configurations from x-ray projections

    Science.gov (United States)

    Murphy, Martin J.; Todor, Dorin A.

    2005-06-01

    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.

  11. A regularizing iterative ensemble Kalman method for PDE-constrained inverse problems

    Science.gov (United States)

    Iglesias, Marco A.

    2016-02-01

    We introduce a derivative-free computational framework for approximating solutions to nonlinear PDE-constrained inverse problems. The general aim is to merge ideas from iterative regularization with ensemble Kalman methods from Bayesian inference to develop a derivative-free stable method easy to implement in applications where the PDE (forward) model is only accessible as a black box (e.g. with commercial software). The proposed regularizing ensemble Kalman method can be derived as an approximation of the regularizing Levenberg-Marquardt (LM) scheme (Hanke 1997 Inverse Problems 13 79-95) in which the derivative of the forward operator and its adjoint are replaced with empirical covariances from an ensemble of elements from the admissible space of solutions. The resulting ensemble method consists of an update formula that is applied to each ensemble member and that has a regularization parameter selected in a similar fashion to the one in the LM scheme. Moreover, an early termination of the scheme is proposed according to a discrepancy principle-type of criterion. The proposed method can be also viewed as a regularizing version of standard Kalman approaches which are often unstable unless ad hoc fixes, such as covariance localization, are implemented. The aim of this paper is to provide a detailed numerical investigation of the regularizing and convergence properties of the proposed regularizing ensemble Kalman scheme; the proof of these properties is an open problem. By means of numerical experiments, we investigate the conditions under which the proposed method inherits the regularizing properties of the LM scheme of (Hanke 1997 Inverse Problems 13 79-95) and is thus stable and suitable for its application in problems where the computation of the Fréchet derivative is not computationally feasible. More concretely, we study the effect of ensemble size, number of measurements, selection of initial ensemble and tunable parameters on the performance of the method

  12. Application of the differential transformation method and variational iteration method to large deformation of cantilever beams under point load

    Energy Technology Data Exchange (ETDEWEB)

    Salehi, Pouya [Semnan Univ., Semnan (Iran, Islamic Republic of); Yaghoobi, Hessamed Din; Torabi, Mohsen [City Univ. of Hong Kong, Hong Kong (China)

    2012-09-15

    Large deflection of a cantilever beam subjected to a tip concentrated load is governed by a non-linear differential equation. Since it is hard to find exact or closed form solutions for this non-linear problem, this paper investigates the aforementioned problem via the differential transformation method (DTM) and the variational iteration method (VIM), which are well known approximate analytical solutions. The mathematical formulation is yielded to a non-linear two-point boundary value problem. In this study, we compare the DTM and VIM results, with those of Adomian decomposition method (ADM) and the established numerical solution obtained by the Richardson extrapolation in order to verify the accuracy of the proposed methods. As an important result, it is depicted from tabulated data that the DTM results are more accurate in comparison with those obtained by the VIM and ADM, which is one of the objectives of this article. Moreover, the effects of dimensionless end point load, {alpha} , on the slope of any point along the arc length and the dimensionless vertical and horizontal displacements are illustrated and explained. The results reveal that these methods are very effective and convenient in predicting the solution of such problems, and it is predicted that the DTM and VIM can find a wide application in new engineering problems.

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

  14. Methodes iteratives paralleles: Applications en neutronique et en mecanique des fluides

    Science.gov (United States)

    Qaddouri, Abdessamad

    Dans cette these, le calcul parallele est applique successivement a la neutronique et a la mecanique des fluides. Dans chacune de ces deux applications, des methodes iteratives sont utilisees pour resoudre le systeme d'equations algebriques resultant de la discretisation des equations du probleme physique. Dans le probleme de neutronique, le calcul des matrices des probabilites de collision (PC) ainsi qu'un schema iteratif multigroupe utilisant une methode inverse de puissance sont parallelises. Dans le probleme de mecanique des fluides, un code d'elements finis utilisant un algorithme iteratif du type GMRES preconditionne est parallelise. Cette these est presentee sous forme de six articles suivis d'une conclusion. Les cinq premiers articles traitent des applications en neutronique, articles qui representent l'evolution de notre travail dans ce domaine. Cette evolution passe par un calcul parallele des matrices des PC et un algorithme multigroupe parallele teste sur un probleme unidimensionnel (article 1), puis par deux algorithmes paralleles l'un mutiregion l'autre multigroupe, testes sur des problemes bidimensionnels (articles 2--3). Ces deux premieres etapes sont suivies par l'application de deux techniques d'acceleration, le rebalancement neutronique et la minimisation du residu aux deux algorithmes paralleles (article 4). Finalement, on a mis en oeuvre l'algorithme multigroupe et le calcul parallele des matrices des PC sur un code de production DRAGON ou les tests sont plus realistes et peuvent etre tridimensionnels (article 5). Le sixieme article (article 6), consacre a l'application a la mecanique des fluides, traite la parallelisation d'un code d'elements finis FES ou le partitionneur de graphe METIS et la librairie PSPARSLIB sont utilises.

  15. [Use of nonparametric methods in medicine. V. A probability test using iteration].

    Science.gov (United States)

    Gerylovová, A; Holcík, J

    1990-10-01

    The authors give an account of the so-called Wald-Wolfowitz test of iteration of two types of elements by means of which it is possible to test the probability of the pattern of two types of elements. To facilitate the application of the test five percent critical values are given for the number of iterations for left-sided, right-sided and bilateral alternative hypotheses. The authors present also tables of critical values for up and down iterations which are obtained when we replace the originally assessed sequence of observations by a sequence +1 and -1, depending on the sign of the consecutive differences. The application of the above tests is illustrated on examples.

  16. 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; Godart, J.; Wauben, D. J. L.; Langendijk, J. A.; 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

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

  18. Monitoring of the relationship between Ha and Da emission as a detection method for water microleaks into ITER

    Science.gov (United States)

    Vizgalov, I. V.; Sorokin, I. A.; Kurnaev, V. A.

    2016-09-01

    The validation of spectroscopic method for water microleakage detection in ITER plasma chamber by IO Vis/IR diagnostic system is presented. The method is based on evaluation of the intensity ratio between Ha and Da spectroscopic lines. They have rather large intensity in low pressure discharges (glow, RF, microwave, for instance) and correspond to the middle of the range 615-700 nm with maximum of the IO Vis/IR sensitivity.

  19. Simulation of bluff-body flows using iterative penalization in a multiresolution particle-mesh vortex method

    DEFF Research Database (Denmark)

    Spietz, Henrik Juul; Hejlesen, Mads Mølholm; Walther, Jens Honore

    in the oncoming flow. This may lead to structural instability e.g. when the shedding frequency aligns with the natural frequency of the structure. Fluid structure interaction must especially be considered when designing long span bridges. A three dimensional vortex-in-cell method is applied for the direct....... This we combine with an iterative penalization method, that allows the simulation of external flows past arbitrary geometries in arbitrary motions such as bridge decks in forced heave and pitch motion...

  20. Numerical simulation of KdV and mKdV equations with initial conditions by the variational iteration method

    Energy Technology Data Exchange (ETDEWEB)

    Inc, Mustafa [Department of Mathematics, Firat University, 23119 Elazig (Turkey)]. E-mail: minc@firat.edu.tr200

    2007-11-15

    A scheme is developed for the numerical study of the Korteweg-de Vries (KdV) and the modified Korteweg-de Vries (mKdV) equations with initial conditions by a variational approach. The exact and numerical solutions obtained by variational iteration method are compared with those obtained by Adomian decomposition method. The comparison shows that the obtained solutions are in excellent agreement.

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

  2. Iteration, Not Induction

    Science.gov (United States)

    Dobbs, David E.

    2009-01-01

    The main purpose of this note is to present and justify proof via iteration as an intuitive, creative and empowering method that is often available and preferable as an alternative to proofs via either mathematical induction or the well-ordering principle. The method of iteration depends only on the fact that any strictly decreasing sequence of…

  3. Convergence results for two asymptotically quasi-I-nonexpansive mappings and equilibrium problem in Banach spaces

    Directory of Open Access Journals (Sweden)

    Vinod Kumar Sahu

    2016-12-01

    Full Text Available In this article, we consider an implicit iterative scheme for two asymptotically quasi-I-nonexpansive mappings T1, T2 and two asymptotically quasi-nonexpansive mapping I1, I2 in Banach spaces. We prove weak and strong convergence results for considered iteration to common fixed point of such mappings. Our main results improve and compliment some known results.

  4. ASYMPTOTIC PROPERTIES OF MLE FOR WEIBULL DISTRIBUTION WITH GROUPED DATA

    Institute of Scientific and Technical Information of China (English)

    XUE Hongqi; SONG Lixin

    2002-01-01

    A grouped data model for Weibull distribution is considered. Under mild con-ditions, the maximum likelihood estimators(MLE) are shown to be identifiable, strongly consistent, asymptotically normal, and satisfy the law of iterated logarithm. Newton iter- ation algorithm is also considered, which converges to the unique solution of the likelihood equation. Moreover, we extend these results to a random case.

  5. Non-expansive Mappings and Iterative Methods in Uniformly Convex Banach Spaces

    Institute of Scientific and Technical Information of China (English)

    Hai Yun ZHOU

    2004-01-01

    In this article, we will investigate the properties of iterative sequence for non-expansive mappings and present several strong and weak convergence results of successive approximations to fixed points of non-expansive mappings in uniformly convex Banach spaces. The results presented in this article generalize and improve various ones concerned with constructive techniques for the fixed points of non-expansive mappings.

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

  7. Joint Newton Iteration and Neumann Series Method of Convergence-Accelerating Matrix Inversion Approximation in Linear Precoding for Massive MIMO Systems

    Directory of Open Access Journals (Sweden)

    Lin Shao

    2016-01-01

    Full Text Available Due to large numbers of antennas and users, matrix inversion is complicated in linear precoding techniques for massive MIMO systems. Several approximated matrix inversion methods, including the Neumann series, have been proposed to reduce the complexity. However, the Neumann series does not converge fast enough. In this paper, to speed up convergence, a new joint Newton iteration and Neumann series method is proposed, with the first iteration result of Newton iteration method being employed to reconstruct the Neumann series. Then, a high probability convergence condition is established, which can offer useful guidelines for practical massive MIMO systems. Finally, simulation examples are given to demonstrate that the new joint Newton iteration and Neumann series method has a faster convergence rate compared to the previous Neumann series, with almost no increase in complexity when the iteration number is greater than or equal to 2.

  8. Absolute x-ray energy calibration over a wide energy range using a diffraction-based iterative method.

    Science.gov (United States)

    Hong, Xinguo; Chen, Zhiqiang; Duffy, Thomas S

    2012-06-01

    In this paper, we report a method of precise and fast absolute x-ray energy calibration over a wide energy range using an iterative x-ray diffraction based method. Although accurate x-ray energy calibration is indispensable for x-ray energy-sensitive scattering and diffraction experiments, there is still a lack of effective methods to precisely calibrate energy over a wide range, especially when normal transmission monitoring is not an option and complicated micro-focusing optics are fixed in place. It is found that by using an iterative algorithm the x-ray energy is only tied to the relative offset of sample-to-detector distance, which can be readily varied with high precision of the order of 10(-5) -10(-6) spatial resolution using gauge blocks. Even starting with arbitrary initial values of 0.1 Å, 0.3 Å, and 0.4 Å, the iteration process converges to a value within 3.5 eV for 31.122 keV x-rays after three iterations. Different common diffraction standards CeO(2), Au, and Si show an energy deviation of 14 eV. As an application, the proposed method has been applied to determine the energy-sensitive first sharp diffraction peak of network forming GeO(2) glass at high pressure, exhibiting a distinct behavior in the pressure range of 2-4 GPa. Another application presented is pair distribution function measurement using calibrated high-energy x-rays at 82.273 keV. Unlike the traditional x-ray absorption-based calibration method, the proposed approach does not rely on any edges of specific elements, and is applicable to the hard x-ray region where no appropriate absorption edge is available.

  9. Composite asymptotic expansions

    CERN Document Server

    Fruchard, Augustin

    2013-01-01

    The purpose of these lecture notes is to develop a theory of asymptotic expansions for functions involving two variables, while at the same time using functions involving one variable and functions of the quotient of these two variables. Such composite asymptotic expansions (CAsEs) are particularly well-suited to describing solutions of singularly perturbed ordinary differential equations near turning points. CAsEs imply inner and outer expansions near turning points. Thus our approach is closely related to the method of matched asymptotic expansions. CAsEs offer two unique advantages, however. First, they provide uniform expansions near a turning point and away from it. Second, a Gevrey version of CAsEs is available and detailed in the lecture notes. Three problems are presented in which CAsEs are useful. The first application concerns canard solutions near a multiple turning point. The second application concerns so-called non-smooth or angular canard solutions. Finally an Ackerberg-O’Malley resonance pro...

  10. Constraint satisfaction and optimization for space station short-term mission planning based on an iterative conflict-repair method

    Science.gov (United States)

    Bu, Hui-Jiao; Zhang, Jin; Luo, Ya-Zhong

    2016-10-01

    This article studies the optimization of space station short-term mission planning (STMP) problems. The domain knowledge including description and the concept definitions of the STMP problem are presented, an STMP constraint satisfaction model is developed, and then an iterative conflict-repair method with the resolving strategies is proposed to satisfy complicated constraints. A genetic algorithm (GA) is adopted to optimize the STMP problem. The proposed approach is evaluated using a test case with 15 missions, 13 devices and three astronauts. The results show that the established STMP constraint satisfaction model is effective, and the iterative conflict-repair method can make the plan satisfy all constraints considered and can effectively improve the optimization performance of the GA.

  11. δ-方法在统计量渐近分布中的应用%Applications of δ-method in Asymptotic Distribution of Statistics

    Institute of Scientific and Technical Information of China (English)

    周小双

    2013-01-01

    Delta-method is an important conclusion in the teaching of probability and statistics, and it has wide applications in the asymptotic distribution of statistics. In this paper, we mainly elaborate the applications of delta-method in the asymptotic distributions through some examples.%  δ-方法是概率论与数理统计教学中一极其重要的引理,在统计量渐近分布中用处十分广泛。本文主要通过实例说明了δ-方法在统计量极限分布中的应用。

  12. Approximate Modified Policy Iteration

    CERN Document Server

    Scherrer, Bruno; Ghavamzadeh, Mohammad; Geist, Matthieu

    2012-01-01

    Modified policy iteration (MPI) is a dynamic programming (DP) algorithm that contains the two celebrated policy and value iteration methods. Despite its generality, MPI has not been thoroughly studied, especially its approximation form which is used when the state and/or action spaces are large or infinite. In this paper, we propose three approximate MPI (AMPI) algorithms that are extensions of the well-known approximate DP algorithms: fitted-value iteration, fitted-Q iteration, and classification-based policy iteration. We provide an error propagation analysis for AMPI that unifies those for approximate policy and value iteration. We also provide a finite-sample analysis for the classification-based implementation of AMPI (CBMPI), which is more general (and somehow contains) than the analysis of the other presented AMPI algorithms. An interesting observation is that the MPI's parameter allows us to control the balance of errors (in value function approximation and in estimating the greedy policy) in the fina...

  13. Strong convergence theorems by hybrid projection methods for equilibrium problems and fixed point problems of the asymptotically quasi-ϕ-nonexpansive mappings

    Directory of Open Access Journals (Sweden)

    Kim Jong

    2011-01-01

    Full Text Available Abstract We consider a hybrid projection method for finding a common element in the fixed point set of an asymptotically quasi-ϕ-nonexpansive mapping and in the solution set of an equilibrium problem. Strong convergence theorems of common elements are established in a uniformly smooth and strictly convex Banach space which has the Kadec-Klee property. 2000 Mathematics subject classification: 47H05, 47H09, 47H10, 47J25

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

  15. Prospective ECG-triggered coronary CT angiography: clinical value of noise-based tube current reduction method with iterative reconstruction.

    Directory of Open Access Journals (Sweden)

    Junlin Shen

    Full Text Available OBJECTIVES: To evaluate the clinical value of noise-based tube current reduction method with iterative reconstruction for obtaining consistent image quality with dose optimization in prospective electrocardiogram (ECG-triggered coronary CT angiography (CCTA. MATERIALS AND METHODS: We performed a prospective randomized study evaluating 338 patients undergoing CCTA with prospective ECG-triggering. Patients were randomly assigned to fixed tube current with filtered back projection (Group 1, n = 113, noise-based tube current with filtered back projection (Group 2, n = 109 or with iterative reconstruction (Group 3, n = 116. Tube voltage was fixed at 120 kV. Qualitative image quality was rated on a 5-point scale (1 = impaired, to 5 = excellent, with 3-5 defined as diagnostic. Image noise and signal intensity were measured; signal-to-noise ratio was calculated; radiation dose parameters were recorded. Statistical analyses included one-way analysis of variance, chi-square test, Kruskal-Wallis test and multivariable linear regression. RESULTS: Image noise was maintained at the target value of 35HU with small interquartile range for Group 2 (35.00-35.03HU and Group 3 (34.99-35.02HU, while from 28.73 to 37.87HU for Group 1. All images in the three groups were acceptable for diagnosis. A relative 20% and 51% reduction in effective dose for Group 2 (2.9 mSv and Group 3 (1.8 mSv were achieved compared with Group 1 (3.7 mSv. After adjustment for scan characteristics, iterative reconstruction was associated with 26% reduction in effective dose. CONCLUSION: Noise-based tube current reduction method with iterative reconstruction maintains image noise precisely at the desired level and achieves consistent image quality. Meanwhile, effective dose can be reduced by more than 50%.

  16. Anomaly Event Detection Method Based on Compressive Sensing and Iteration in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Shihua Cao

    2014-03-01

    Full Text Available Anomaly event detection is one of the research hotspots in wireless sensor networks. Aiming at the disadvantages of current detection solutions, a novel anomaly event detection algorithm based on compressed sensing and iteration is proposed. Firstly, a measured value can be sensed in each node, based on the compressed sensing. Then the problem of anomaly event detection is modeled as the minimization problem of weighted l1 norm, and OMP algorithm is adopted for solving the problem iteratively. And then the result of problem solving is judged according to detection functions. Finally, in the light of the judgment results, the weight value is updated for beginning a new round iteration. The loop won't stop until all the anomaly events are detected in wireless sensor networks. Simulation experimental results show the proposed algorithm has a better omission detection rate and false alarm rate in different noisy environments. In addition, the detection quality of this algorithm is higher than those of the traditional ones.

  17. Evaluation of algebraic iterative image reconstruction methods for tetrahedron beam computed tomography systems.

    Science.gov (United States)

    Kim, Joshua; Guan, Huaiqun; Gersten, David; Zhang, Tiezhi

    2013-01-01

    Tetrahedron beam computed tomography (TBCT) performs volumetric imaging using a stack of fan beams generated by a multiple pixel X-ray source. While the TBCT system was designed to overcome the scatter and detector issues faced by cone beam computed tomography (CBCT), it still suffers the same large cone angle artifacts as CBCT due to the use of approximate reconstruction algorithms. It has been shown that iterative reconstruction algorithms are better able to model irregular system geometries and that algebraic iterative algorithms in particular have been able to reduce cone artifacts appearing at large cone angles. In this paper, the SART algorithm is modified for the use with the different TBCT geometries and is tested using both simulated projection data and data acquired using the TBCT benchtop system. The modified SART reconstruction algorithms were able to mitigate the effects of using data generated at large cone angles and were also able to reconstruct CT images without the introduction of artifacts due to either the longitudinal or transverse truncation in the data sets. Algebraic iterative reconstruction can be especially useful for dual-source dual-detector TBCT, wherein the cone angle is the largest in the center of the field of view.

  18. Evaluation of Algebraic Iterative Image Reconstruction Methods for Tetrahedron Beam Computed Tomography Systems

    Directory of Open Access Journals (Sweden)

    Joshua Kim

    2013-01-01

    Full Text Available Tetrahedron beam computed tomography (TBCT performs volumetric imaging using a stack of fan beams generated by a multiple pixel X-ray source. While the TBCT system was designed to overcome the scatter and detector issues faced by cone beam computed tomography (CBCT, it still suffers the same large cone angle artifacts as CBCT due to the use of approximate reconstruction algorithms. It has been shown that iterative reconstruction algorithms are better able to model irregular system geometries and that algebraic iterative algorithms in particular have been able to reduce cone artifacts appearing at large cone angles. In this paper, the SART algorithm is modified for the use with the different TBCT geometries and is tested using both simulated projection data and data acquired using the TBCT benchtop system. The modified SART reconstruction algorithms were able to mitigate the effects of using data generated at large cone angles and were also able to reconstruct CT images without the introduction of artifacts due to either the longitudinal or transverse truncation in the data sets. Algebraic iterative reconstruction can be especially useful for dual-source dual-detector TBCT, wherein the cone angle is the largest in the center of the field of view.

  19. Comparison of Optimal Homotopy Asymptotic and Adomian Decomposition Methods for a Thin Film Flow of a Third Grade Fluid on a Moving Belt

    Directory of Open Access Journals (Sweden)

    Fazle Mabood

    2015-01-01

    Full Text Available We have investigated a thin film flow of a third grade fluid on a moving belt using a powerful and relatively new approximate analytical technique known as optimal homotopy asymptotic method (OHAM. The variation of velocity profile for different parameters is compared with the numerical values obtained by Runge-Kutta Fehlberg fourth-fifth order method and with Adomian Decomposition Method (ADM. An interesting result of the analysis is that the three terms OHAM solution is more accurate than five terms of the ADM solution and this thus confirms the feasibility of the proposed method.

  20. Iterative method for the numerical solution of a system of integral equations for the heat conduction initial boundary value problem

    Science.gov (United States)

    Svetushkov, N. N.

    2016-11-01

    The paper deals with a numerical algorithm to reduce the overall system of integral equations describing the heat transfer process at any geometrically complex area (both twodimensional and three-dimensional), to the iterative solution of a system of independent onedimensional integral equations. This approach has been called "string method" and has been used to solve a number of applications, including the problem of the detonation wave front for the calculation of heat loads in pulse detonation engines. In this approach "the strings" are a set of limited segments parallel to the coordinate axes, into which the whole solving area is divided (similar to the way the strings are arranged in a tennis racket). Unlike other grid methods where often for finding solutions, the values of the desired function in the region located around a specific central point here in each iteration step is determined by the solution throughout the length of the one-dimensional "string", which connects the two end points and set them values and determine the temperature distribution along all the strings in the first step of an iterative procedure.

  1. Banach空间中有限族渐进伪压缩映象的迭代程序%Iterative Schemes for a Family of Finite Asymptotically Pseudocontractive Mappings in Banach Spaces

    Institute of Scientific and Technical Information of China (English)

    谷峰

    2009-01-01

    Let E be a real Banach space and K be a nonempty closed convex and bounded subset of E.Let Ti : K → K,i = 1,2,...,N,be N uniformly L-Lipschitzian,uniformly asymptotically regular with sequences {εn (i)} and asymptotically pseudocontractive mappings with sequences {kn (i)},where {kn (i)} and {εn (i)},i = 1,2,...,N,satisfy certain mild conditions.Let a sequence {xn} be generated from x1 ∈ K by zn:= (1-1μn)xn+μnTnnxn,xn1 := λnθnx1+ [1-λn(1 + θn)]xn + λnTnnzn for all integer n≥ 1,where Tn = Tn(mod N),and {λn},{θn} and {μn} are three real sequences in [0,1] satisfying appropriate conditions.Then ‖xn -Tixn‖→0as n →∞ for each l ∈ {1,2,...,N}.The results presented in this paper generalize and improve the corresponding results of Chidume and Zegeye[1],Reinermann[10],Rhoades[11] and Schu[13].

  2. An iterative method applied to optimize the design of PIN photodiodes for enhanced radiation tolerance and maximum light response

    Energy Technology Data Exchange (ETDEWEB)

    Cedola, A.P., E-mail: ariel.cedola@ing.unlp.edu.a [Grupo de Estudio de Materiales y Dispositivos Electronicos (GEMyDE), Dpto. Electrotecnia, Facultad de Ingenieria, Universidad Nacional de La Plata, 48 y 116, C.C. 91, La Plata 1900, Buenos Aires (Argentina); Cappelletti, M.A. [Grupo de Estudio de Materiales y Dispositivos Electronicos (GEMyDE), Dpto. Electrotecnia, Facultad de Ingenieria, Universidad Nacional de La Plata, 48 y 116, C.C. 91, La Plata 1900, Buenos Aires (Argentina); Casas, G. [Grupo de Estudio de Materiales y Dispositivos Electronicos (GEMyDE), Dpto. Electrotecnia, Facultad de Ingenieria, Universidad Nacional de La Plata, 48 y 116, C.C. 91, La Plata 1900, Buenos Aires (Argentina); Universidad Nacional de Quilmes, Roque Saenz Pena 352, Bernal 1876, Buenos Aires (Argentina); Peltzer y Blanca, E.L. [Grupo de Estudio de Materiales y Dispositivos Electronicos (GEMyDE), Dpto. Electrotecnia, Facultad de Ingenieria, Universidad Nacional de La Plata, 48 y 116, C.C. 91, La Plata 1900, Buenos Aires (Argentina); Instituto de Fisica de Liquidos y Sistemas Biologicos (IFLYSIB), CONICET - UNLP - CIC, La Plata 1900, Buenos Aires (Argentina)

    2011-02-11

    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.

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

  4. Fittino, a program for determining MSSM parameters from collider observables using an iterative method

    Science.gov (United States)

    Bechtle, P.; Desch, K.; Wienemann, P.

    2006-01-01

    Provided that Supersymmetry (SUSY) is realized, the Large Hadron Collider (LHC) and the future International Linear Collider (ILC) may provide a wealth of precise data from SUSY processes. An important task will be to extract the Lagrangian parameters. On this basis the goal is to uncover the underlying symmetry breaking mechanism from the measured observables. In order to determine the SUSY parameters, the program Fittino has been developed. It uses an iterative fitting technique and a Simulated Annealing algorithm to determine the SUSY parameters directly from the observables without any a priori knowledge of the parameters, using all available loop-corrections to masses and couplings. Simulated Annealing is implemented as a stable and efficient method for finding the optimal parameter values. The theoretical predictions can be provided from any program with SUSY Les Houches Accord interface. As fit result, a set of parameters including the full error matrix and two-dimensional uncertainty contours are obtained. Pull distributions can automatically be created and allow an independent cross-check of the fit results and possible systematic shifts in the parameter determination. A determination of the importance of the individual observables for the measurement of each parameter can be performed after the fit. A flexible user interface is implemented, allowing a wide range of different types of observables and a wide range of parameters to be used. Program summaryProgram title: Fittino Catalogue identifier: ADWN Program summary URL:http://cpc.cs.qub.ac.uk/summaries/ADWN Licensing provisions: GNU General Public License Programming language:C++ Computer: any computer Operating system: Linux and other Unix flavors RAM: ca. 22 MB No. of lines in distributed program, including test data, etc.: 111 962 No. of bytes in distributed program, including test data, etc.: 1 006 727 Distribution format: tar.gz Number of processors used: 1 External routines: The ROOT data analysis

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

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

  7. Asymptotic Analysis of Vertical Branch-Cut Integral of Shear Waves in a Fluid-Filled Borehole Utilizing the Steepest-Descent Method

    Institute of Scientific and Technical Information of China (English)

    YAO Gui-Jin; SONG Ruo-Long; WANG Ke-Xie

    2008-01-01

    We obtaln an asymptotic solution to the vertical branch-cut integral of shear waves excited by an impulsive pressure point source in a fluid-filled borehole,by taking the effect of the infinite singularity of the Hankel functions related to shear waves in the integrand at the shear branch point into account and using the method of steepest-descent to expand the vertical branch-cut integral of shear waves.It is theoretically proven that the saddle point of the integrand is locared at ks-i/z,where ks and z are the shear branch point and the offset.The continuous and smooth amplitude spectra and the resonant peaks of shear waves are numerically calculated from the asymptotic solution.These asymptotic results are generally in agreement with the numerical integral results.It is also found by the comparison and analysis of two results that the resonant factor and the effect of the normal and leaking mode poles around the shear branch point lead to the two-peak characteristics of the amplitude spectra of shear waves in the resonant peak zones from the numerical integral calculations.

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

  9. A study on the quintic nonlinear beam vibrations using asymptotic approximate approaches

    Science.gov (United States)

    Sedighi, Hamid M.; Shirazi, Kourosh H.; Attarzadeh, Mohammad A.

    2013-10-01

    This paper intends to promote the application of modern analytical approaches to the governing equation of transversely vibrating quintic nonlinear beams. Four new studied methods are Stiffness analytical approximation method, Homotopy Perturbation Method with an Auxiliary Term, Max-Min Approach (MMA) and Iteration Perturbation Method (IPM). The powerful analytical approaches are used to obtain the nonlinear frequency-amplitude relationship for dynamic behavior of vibrating beams with quintic nonlinearity. It is demonstrated that the first terms in series expansions of all methods are sufficient to obtain a highly accurate solution. Finally, a numerical example is conducted to verify the integrity of the asymptotic methods.

  10. An iterative method for solving Fredholm integral equations of the first kind

    OpenAIRE

    Indratno, Sapto W.; Ramm, A. G.

    2009-01-01

    The purpose of this paper is to give a convergence analysis of the iterative scheme: \\bee u_n^\\dl=qu_{n-1}^\\dl+(1-q)T_{a_n}^{-1}K^*f_\\dl,\\quad u_0^\\dl=0,\\eee where $T:=K^*K,\\quad T_a:=T+aI,\\quad q\\in(0,1),\\quad a_n:=\\alpha_0q^n, \\alpha_0>0,$ with finite-dimensional approximations of $T$ and $K^*$ for solving stably Fredholm integral equations of the first kind with noisy data.

  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. The fixed-point iteration method for IMRT optimization with truncated dose deposition coefficient matrix

    CERN Document Server

    Tian, Zhen; Jia, Xun; Jiang, Steve B

    2013-01-01

    In the treatment plan optimization for intensity modulated radiation therapy (IMRT), dose-deposition coefficient (DDC) matrix is often pre-computed to parameterize the dose contribution to each voxel in the volume of interest from each beamlet of unit intensity. However, due to the limitation of computer memory and the requirement on computational efficiency, in practice matrix elements of small values are usually truncated, which inevitably compromises the quality of the resulting plan. A fixed-point iteration scheme has been applied in IMRT optimization to solve this problem, which has been reported to be effective and efficient based on the observations of the numerical experiments. In this paper, we aim to point out the mathematics behind this scheme and to answer the following three questions: 1) whether the fixed-point iteration algorithm converges or not? 2) when it converges, whether the fixed point solution is same as the original solution obtained with the complete DDC matrix? 3) if not the same, wh...

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

  14. Asymptotic properties of the C-Metric

    CERN Document Server

    Sladek, Pavel

    2010-01-01

    The aim of this article is to analyze the asymptotic properties of the C-metric, using a general method specified in work of Tafel and coworkers, [1], [2], [3]. By finding an appropriate conformal factor $\\Omega$, it allows the investigation of the asymptotic properties of a given asymptotically flat spacetime. The news function and Bondi mass aspect are computed, their general properties are analyzed, as well as the small mass, small acceleration, small and large Bondi time limits.

  15. Asymptotics for dissipative nonlinear equations

    CERN Document Server

    Hayashi, Nakao; Kaikina, Elena I; Shishmarev, Ilya A

    2006-01-01

    Many of problems of the natural sciences lead to nonlinear partial differential equations. However, only a few of them have succeeded in being solved explicitly. Therefore different methods of qualitative analysis such as the asymptotic methods play a very important role. This is the first book in the world literature giving a systematic development of a general asymptotic theory for nonlinear partial differential equations with dissipation. Many typical well-known equations are considered as examples, such as: nonlinear heat equation, KdVB equation, nonlinear damped wave equation, Landau-Ginzburg equation, Sobolev type equations, systems of equations of Boussinesq, Navier-Stokes and others.

  16. TWO ITERATION METHODS FOR SOLVING LINEAR ALGEBRAIC SYSTEMS WITH LOW ORDER MATRIX A AND HIGH ORDER MATRIX B: Y = (A B)Y + Ф

    Institute of Scientific and Technical Information of China (English)

    Shuang-suo Zhao; Zhang-hua Luo; Guo-feng Zhang

    2000-01-01

    This paper presents optimum an one-parameter iteration (OOPI) method and a multi-parameter iteration direct (MPID) method for efficiently solving linear algebraic systems with low order matrix A and high order matrix B: Y = (A B)Y +Ф. On parallel computers (also on serial computer) the former will be efficient, even very efficient under certain conditions, the latter will be universally very efficient.

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

  18. A Brownian dynamics study on ferrofluid colloidal dispersions using an iterative constraint method to satisfy Maxwell's equations

    Science.gov (United States)

    Dubina, Sean Hyun; Wedgewood, Lewis Edward

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

  19. Direct design of freeform surfaces and freeform imaging systems with a point-by-point three-dimensional construction-iteration method.

    Science.gov (United States)

    Yang, Tong; Zhu, Jun; Wu, Xiaofei; Jin, Guofan

    2015-04-20

    In this paper, we proposed a general direct design method for three-dimensional freeform surfaces and freeform imaging systems based on a construction-iteration process. In the preliminary surfaces-construction process, the coordinates as well as the surface normals of the data points on the multiple freeform surfaces can be calculated directly considering the rays of multiple fields and different pupil coordinates. Then, an iterative process is employed to significantly improve the image quality or achieve a better mapping relationship of the light rays. Three iteration types which are normal iteration, negative feedback and successive approximation are given. The proposed construction-iteration method is applied in the design of an easy aligned, low F-number off-axis three-mirror system. The primary and tertiary mirrors can be fabricated on a single substrate and form a single element in the final system. The secondary mirror is simply a plane mirror. With this configuration, the alignment difficulty of a freeform system can be greatly reduced. After the preliminary surfaces-construction stage, the freeform surfaces in the optical system can be generated directly from an initial planar system. Then, with the iterative process, the average RMS spot diameter decreased by 75.4% compared with the system before iterations, and the maximum absolute distortion decreased by 94.2%. After further optimization with optical design software, good image quality which is closed to diffraction-limited is achieved.

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

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

  2. Parallelizable restarted iterative methods for nonsymmetric linear systems. Part 1: Theory

    Energy Technology Data Exchange (ETDEWEB)

    Joubert, W.D.; Carey, G.F.

    1991-05-01

    Large sparse nonsymmetric problems of the form Au = b are frequently solved using restarted conjugate gradient-type algorithms such as the popular GCR and GMRES algorithms. In this study the authors define a new class of algorithms which generate the same iterates as the standard GMRES algorithm but require as little as half of the computational expense. This performance improvement is obtained by using short economical three-term recurrences to replace the long recurrence used by GMRES. The new algorithms are shown to have good numerical properties in typical cases, and the new algorithms may be easily modified to be as numerically safe as standard GMRES. Numerical experiments with these algorithms are given in Part 2, in which they demonstrate the improved performance of the new schemes on different computer architectures.

  3. Asymptotic Behaviour Near a Nonlinear Sink

    CERN Document Server

    Calder, Matt S

    2010-01-01

    In this paper, we will explore an iterative procedure to determine the detailed asymptotic behaviour of solutions of a certain class of nonlinear vector differential equations which approach a nonlinear sink as time tends to infinity. This procedure is indifferent to resonance in the eigenvalues. Moreover, we will address the writing of one component in terms of the other in the case of a planar system. Examples will be given, notably the Michaelis-Menten mechanism of enzyme kinetics.

  4. Strong Convergence of Modified Ishikawa Iterations for Nonlinear Mappings

    Indian Academy of Sciences (India)

    Yongfu Su; Xiaolong Qin

    2007-02-01

    In this paper, we prove a strong convergence theorem of modified Ishikawa iterations for relatively asymptotically nonexpansive mappings in Banach space. Our results extend and improve the recent results by Nakajo, Takahashi, Kim, $Xu$, Matsushita and some others.

  5. Approximate iterative algorithms

    CERN Document Server

    Almudevar, Anthony Louis

    2014-01-01

    Iterative algorithms often rely on approximate evaluation techniques, which may include statistical estimation, computer simulation or functional approximation. This volume presents methods for the study of approximate iterative algorithms, providing tools for the derivation of error bounds and convergence rates, and for the optimal design of such algorithms. Techniques of functional analysis are used to derive analytical relationships between approximation methods and convergence properties for general classes of algorithms. This work provides the necessary background in functional analysis a

  6. Calculation of Cross Section of Radiative Halo-Neutron Capture by 12C at Stellar Energy with the Asymptotic Normalization Coefficient Method

    Institute of Scientific and Technical Information of China (English)

    WU Kai-Su; CHEN Yong-Shou; LIU Zu-Hua; LIN Cheng-Jian; ZHANG Huan-Qiao

    2003-01-01

    The cross section of the direct neutron capture reaction 12C(n,7)13C(l/2+) is calculated with the asymptotic normalization coefficient method. The result is in good agreement with a recent experiment at low energy. An enormous enhancement of cross section is found for this direct neutron capture in which a p-wave neutron is captured into an 2?i/2 orbit with neutron halo. The possible effect of the neutron halo structure presented in this reaction on the s-process in astrophysics is discussed in general.

  7. 递推数列极限的初等求法和收敛渐近性%Elementary Methods for Asymptotic Convergence of Recursive Sequences

    Institute of Scientific and Technical Information of China (English)

    赵焕光; 项凌云

    2013-01-01

    借助实例介绍一些非线性递推数列,特别是分式线性递推数列极限的初等求法。就一般分式线性递推数列,明确其收敛渐近性,并通过相关推论展示其应用。%Using elementary methods ,we discuss the convergence and asymptotic properties of some nonlinear recursive sequences , such as fractional linear recursive sequences . We demonstrate also the application .

  8. An algebraic collapsing acceleration method for acceleration of the inner (scattering) iterations in long characteristics transport theory

    Energy Technology Data Exchange (ETDEWEB)

    Suslov, I.R. [Institute for Physics and Power Engineering, Obninsk (Russian Federation)

    2003-07-01

    An acceleration technique for long characteristics discrete ordinates method is presented. The technique is based on the developed representation of the transport sweep finite-difference operator as an sparse matrix operator in the space of the track averaged symmetrized angular fluxes. The collapsing technique is used for the constructing of the reduced sparse matrix with structure similar to block-diffusion in general case. That reduced matrix is applied for the acceleration of the scattering iterations. For slab geometry case it is shown that the simplest (one box collapsing) method is equivalent to consistent diffusion acceleration method. Numerical results for the two-dimensional C5G7MOX OECD benchmark display high efficiency of the developed method. (author)

  9. The variational iteration method and the variational homotopy perturbation method for solving the KdV-Burgers equation and the Sharma-Tasso-Olver equation

    Energy Technology Data Exchange (ETDEWEB)

    Zayed, Elsayed M.E. [Dept. of Mathematics, Zagazig Univ. (Egypt); Abdel Rahman, Hanan M. [Dept. of Basic Sciences, Higher Technological Inst., Tenth of Ramadan City (Egypt)

    2010-01-15

    In this article, two powerful analytical methods called the variational iteration method (VIM) and the variational homotopy perturbation method (VHPM) are introduced to obtain the exact and the numerical solutions of the (2+1)-dimensional Korteweg-de Vries-Burgers (KdVB) equation and the (1+1)-dimensional Sharma-Tasso-Olver equation. The main objective of the present article is to propose alternative methods of solutions, which avoid linearization and physical unrealistic assumptions. The results show that these methods are very efficient, convenient and can be applied to a large class of nonlinear problems. (orig.)

  10. Asymptotics of trimmed CUSUM statistics

    CERN Document Server

    Berkes, István; Schauer, Johannes; 10.3150/10-BEJ318

    2012-01-01

    There is a wide literature on change point tests, but the case of variables with infinite variances is essentially unexplored. In this paper we address this problem by studying the asymptotic behavior of trimmed CUSUM statistics. We show that in a location model with i.i.d. errors in the domain of attraction of a stable law of parameter $0<\\alpha <2$, the appropriately trimmed CUSUM process converges weakly to a Brownian bridge. Thus, after moderate trimming, the classical method for detecting change points remains valid also for populations with infinite variance. We note that according to the classical theory, the partial sums of trimmed variables are generally not asymptotically normal and using random centering in the test statistics is crucial in the infinite variance case. We also show that the partial sums of truncated and trimmed random variables have different asymptotic behavior. Finally, we discuss resampling procedures which enable one to determine critical values in the case of small and mo...

  11. Chebyshev polynomial filtered subspace iteration in the discontinuous Galerkin method for large-scale electronic structure calculations

    Science.gov (United States)

    Banerjee, Amartya S.; Lin, Lin; Hu, Wei; Yang, Chao; Pask, John E.

    2016-10-01

    The Discontinuous Galerkin (DG) electronic structure method employs an adaptive local basis (ALB) set to solve the Kohn-Sham equations of density functional theory in a discontinuous Galerkin framework. The adaptive local basis is generated on-the-fly to capture the local material physics and can systematically attain chemical accuracy with only a few tens of degrees of freedom per atom. A central issue for large-scale calculations, however, is the computation of the electron density (and subsequently, ground state properties) from the discretized Hamiltonian in an efficient and scalable manner. We show in this work how Chebyshev polynomial filtered subspace iteration (CheFSI) can be used to address this issue and push the envelope in large-scale materials simulations in a discontinuous Galerkin framework. We describe how the subspace filtering steps can be performed in an efficient and scalable manner using a two-dimensional parallelization scheme, thanks to the orthogonality of the DG basis set and block-sparse structure of the DG Hamiltonian matrix. The on-the-fly nature of the ALB functions requires additional care in carrying out the subspace iterations. We demonstrate the parallel scalability of the DG-CheFSI approach in calculations of large-scale two-dimensional graphene sheets and bulk three-dimensional lithium-ion electrolyte systems. Employing 55 296 computational cores, the time per self-consistent field iteration for a sample of the bulk 3D electrolyte containing 8586 atoms is 90 s, and the time for a graphene sheet containing 11 520 atoms is 75 s.

  12. Thickness Dispersion of Surface Plasmon of Ag Nano-thin Films: Determination by Ellipsometry Iterated with Transmittance Method

    Science.gov (United States)

    Gong, Junbo; Dai, Rucheng; Wang, Zhongping; Zhang, Zengming

    2015-03-01

    Effective optical constants of Ag thin films are precisely determined with effective thickness simultaneously by using an ellipsometry iterated with transmittance method. Unlike the bulk optical constants in Palik's database the effective optical constants of ultrathin Ag films are found to strongly depend on the thickness. According to the optical data two branches of thickness dispersion of surface plasmon energy are derived and agreed with theoretical predication. The thickness dispersion of bulk plasmon is also observed. The influence of substrate on surface plasmon is verified for the first time by using ellipsometry. The thickness dependent effective energy loss function is thus obtained based on this optical method for Ag ultrathin films. This method is also applicable to other ultrathin films and can be used to establish an effective optical database for ultrathin films.

  13. Enhancement of image quality with a fast iterative scatter and beam hardening correction method for kV CBCT

    Energy Technology Data Exchange (ETDEWEB)

    Reitz, Irmtraud; Hesse, Bernd-Michael; Nill, Simeon; Tuecking, Thomas; Oelfke, Uwe [DKFZ, Heidelberg (Germany)

    2009-07-01

    The problem of the enormous amount of scattered radiation in kV CBCT (kilo voltage cone beam computer tomography) is addressed. Scatter causes undesirable streak- and cup-artifacts and results in a quantitative inaccuracy of reconstructed CT numbers, so that an accurate dose calculation might be impossible. Image contrast is also significantly reduced. Therefore we checked whether an appropriate implementation of the fast iterative scatter correction algorithm we have developed for MV (mega voltage) CBCT reduces the scatter contribution in a kV CBCT as well. This scatter correction method is based on a superposition of pre-calculated Monte Carlo generated pencil beam scatter kernels. The algorithm requires only a system calibration by measuring homogeneous slab phantoms with known water-equivalent thicknesses. In this study we compare scatter corrected CBCT images of several phantoms to the fan beam CT images acquired with a reduced cone angle (a slice-thickness of 14 mm in the isocenter) at the same system. Additional measurements at a different CBCT system were made (different energy spectrum and phantom-to-detector distance) and a first order approach of a fast beam hardening correction will be introduced. The observed, image quality of the scatter corrected CBCT images is comparable concerning resolution, noise and contrast-to-noise ratio to the images acquired in fan beam geometry. Compared to the CBCT without any corrections the contrast of the contrast-and-resolution phantom with scatter correction and additional beam hardening correction is improved by a factor of about 1.5. The reconstructed attenuation coefficients and the CT numbers of the scatter corrected CBCT images are close to the values of the images acquired in fan beam geometry for the most pronounced tissue types. Only for extreme dense tissue types like cortical bone we see a difference in CT numbers of 5.2%, which can be improved to 4.4% with the additional beam hardening correction. Cupping

  14. Enhancement of image quality with a fast iterative scatter and beam hardening correction method for kV CBCT.

    Science.gov (United States)

    Reitz, Irmtraud; Hesse, Bernd-Michael; Nill, Simeon; Tücking, Thomas; Oelfke, Uwe

    2009-01-01

    The problem of the enormous amount of scattered radiation in kV CBCT (kilo voltage cone beam computer tomography) is addressed. Scatter causes undesirable streak- and cup-artifacts and results in a quantitative inaccuracy of reconstructed CT numbers, so that an accurate dose calculation might be impossible. Image contrast is also significantly reduced. Therefore we checked whether an appropriate implementation of the fast iterative scatter correction algorithm we have developed for MV (mega voltage) CBCT reduces the scatter contribution in a kV CBCT as well. This scatter correction method is based on a superposition of pre-calculated Monte Carlo generated pencil beam scatter kernels. The algorithm requires only a system calibration by measuring homogeneous slab phantoms with known water-equivalent thicknesses. In this study we compare scatter corrected CBCT images of several phantoms to the fan beam CT images acquired with a reduced cone angle (a slice-thickness of 14 mm in the isocenter) at the same system. Additional measurements at a different CBCT system were made (different energy spectrum and phantom-to-detector distance) and a first order approach of a fast beam hardening correction will be introduced. The observed image quality of the scatter corrected CBCT images is comparable concerning resolution, noise and contrast-to-noise ratio to the images acquired in fan beam geometry. Compared to the CBCT without any corrections the contrast of the contrast-and-resolution phantom with scatter correction and additional beam hardening correction is improved by a factor of about 1.5. The reconstructed attenuation coefficients and the CT numbers of the scatter corrected CBCT images are close to the values of the images acquired in fan beam geometry for the most pronounced tissue types. Only for extreme dense tissue types like cortical bone we see a difference in CT numbers of 5.2%, which can be improved to 4.4% with the additional beam hardening correction. Cupping is

  15. WEAK AND STRONG CONVERGENCE OF AN ITERATIVE METHOD FOR NONEXPANSIVE MAPPINGS IN HILBERT SPACES

    Directory of Open Access Journals (Sweden)

    Yu Miao

    2008-08-01

    Full Text Available In a real {sc Hilbert} space $H$, starting from an arbitrary initialpoint $x_0in H$, an iterative process is defined as follows:$x_{n+1}=a_nx_n+(1-a_nT^{lambda_{n+1}}_fy_n$, $y_n= b_nx_n+(1-b_nT^{eta_{n}}_gx_n$, $nge 0$, where$T^{lambda_{n+1}}_f x= Tx-lambda_{n+1} mu_f f(Tx$,$T^{eta_{n}}_g x= Tx-eta_{n} mu_g g(Tx$, ($forall xinH$, $T: Ho H$ a nonexpansive mappingwith $F(T eemptyset$ and $f$ (resp. $g$ $: Ho H$ an$eta_f$ (resp. $eta_g$-strongly monotone and $k_f$ (resp. $k_g$-Lipschitzianmapping, ${a_n}subset(0,1$, ${b_n}subset(0,1$ and ${lambda_n}subset[0,1$,${eta_n}subset[0,1$. Under some suitable conditions, severalconvergence results of the sequence ${x_n}$ are shown.

  16. Einstein Constraints on Asymptotically Euclidean Manifolds

    CERN Document Server

    Choquet-Bruhat, Y; York, J W; Choquet-Bruhat, Yvonne; Isenberg, James; York, James W.

    2000-01-01

    We consider the Einstein constraints on asymptotically euclidean manifolds $M$ of dimension $n \\geq 3$ with sources of both scaled and unscaled types. We extend to asymptotically euclidean manifolds the constructive method of proof of existence. We also treat discontinuous scaled sources. In the last section we obtain new results in the case of non-constant mean curvature.

  17. Asymptotic behaviour for a diffusion equation governed by nonlocal interactions

    CERN Document Server

    Ovono, Armel Andami

    2010-01-01

    In this paper we study the asymptotic behaviour of a nonlocal nonlinear parabolic equation governed by a parameter. After giving the existence of unique branch of solutions composed by stable solutions in stationary case, we gives for the parabolic problem $L^\\infty $ estimates of solution based on using the Moser iterations and existence of global attractor. We finish our study by the issue of asymptotic behaviour in some cases when $t\\to \\infty$.

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

  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. [A study of coordinates transform iterative fitting method to extract bio-impedance model parameters bio-impedance model parameters].

    Science.gov (United States)

    Zhou, Liming; Yang, Yuxing; Yuan, Shiying

    2006-02-01

    A new algorithm, the coordinates transform iterative optimizing method based on the least square curve fitting model, is presented. This arithmetic is used for extracting the bio-impedance model parameters. It is superior to other methods, for example, its speed of the convergence is quicker, and its calculating precision is higher. The objective to extract the model parameters, such as Ri, Re, Cm and alpha, has been realized rapidly and accurately. With the aim at lowering the power consumption, decreasing the price and improving the price-to-performance ratio, a practical bio-impedance measure system with double CPUs has been built. It can be drawn from the preliminary results that the intracellular resistance Ri increased largely with an increase in working load during sitting, which reflects the ischemic change of lower limbs.