The General Iterative Methods for Asymptotically Nonexpansive Semigroups in Banach Spaces
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.
Resita Arum, Sari; A, Suparmi; C, Cari
2016-01-01
The Dirac equation for Eckart potential and trigonometric Manning Rosen potential with exact spin symmetry is obtained using an asymptotic iteration method. The combination of the two potentials is substituted into the Dirac equation, then the variables are separated into radial and angular parts. The Dirac equation is solved by using an asymptotic iteration method that can reduce the second order differential equation into a differential equation with substitution variables of hypergeometry type. The relativistic energy is calculated using Matlab 2011. This study is limited to the case of spin symmetry. With the asymptotic iteration method, the energy spectra of the relativistic equations and equations of orbital quantum number l can be obtained, where both are interrelated between quantum numbers. The energy spectrum is also numerically solved using the Matlab software, where the increase in the radial quantum number nr causes the energy to decrease. The radial part and the angular part of the wave function are defined as hypergeometry functions and visualized with Matlab 2011. The results show that the disturbance of a combination of the Eckart potential and trigonometric Manning Rosen potential can change the radial part and the angular part of the wave function. Project supported by the Higher Education Project (Grant No. 698/UN27.11/PN/2015).
A New Approach to Black Hole Quasinormal Modes: A Review of the Asymptotic Iteration Method
H. T. Cho
2012-01-01
Full Text Available We discuss how to obtain black hole quasinormal modes (QNMs using the asymptotic iteration method (AIM, initially developed to solve second-order ordinary differential equations. We introduce the standard version of this method and present an improvement more suitable for numerical implementation. We demonstrate that the AIM can be used to find radial QNMs for Schwarzschild, Reissner-Nordström (RN, and Kerr black holes in a unified way. We discuss some advantages of the AIM over the continued fractions method (CFM. This paper presents for the first time the spin 0, 1/2 and 2 QNMs of a Kerr black hole and the gravitational and electromagnetic QNMs of the RN black hole calculated via the AIM and confirms results previously obtained using the CFM. We also present some new results comparing the AIM to the WKB method. Finally we emphasize that the AIM is well suited to higher-dimensional generalizations and we give an example of doubly rotating black holes.
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, ...... Asymptotic Method (OHAM). The comparisons of the results reveal that these methods are very effective, convenient and quite accurate to systems of non-linear differential equation.......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......, and this process produces noise in the obtained answers. This paper deals with solution of second order of differential equation governing beam deformation using four analytical approximate methods, namely the Homotopy Perturbation Method (HPM), Variational Iteration Method (VIM) and Optimal Homotopy...
This paper presents a non-linear analysis of elastically restrained imperfect shallow spherical shells on pasternak foundation. By adopting the asymptotic iteration method (AIM), an analytical expression concerning the external load and the central deflection of the shell is derived in a non-dimensional form. The solution incorporates the effects of involved parameters, such as geometrical imperfection, extensional and shear moduli of foundation and edge-restraint coefficients as well as structural geometry, and it can be used effectively to perform buckling analysis of such structures. For some classical boundary conditions, the resulting solution has been compared with data available resulting from various approximate methods including Alpha, Berger's method, modified Berger's method, Sinharay and Banerjee's approach and Galerkin's method. The evaluation of the effects of these parameters on critical buckling loads is made numerically. The results show that the present solution can be considered as a more exact solution for determination of non-linear behaviour of such structures
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.
The optimal homotopy asymptotic method engineering applications
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...
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
ASYMPTOTIC METHODS OF STATISTICAL CONTROL
Orlov A. I.
2014-10-01
Full Text Available Statistical control is a sampling control based on the probability theory and mathematical statistics. The article presents the development of the methods of statistical control in our country. It discussed the basics of the theory of statistical control – the plans of statistical control and their operational characteristics, the risks of the supplier and the consumer, the acceptance level of defectiveness and the rejection level of defectiveness. We have obtained the asymptotic method of synthesis of control plans based on the limit average output level of defectiveness. We have also developed the asymptotic theory of single sampling plans and formulated some unsolved mathematical problems of the theory of statistical control
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.
Axelsson, Owe
1. Berlin, Heidelberg: Springer-Verlag, 2013 - (Björm, E.), s. 205-224 ISBN 978-3-540-70528-4 Institutional support: RVO:68145535 Keywords : classical iterative methods * applied computational mathematics * encyclopedia Subject RIV: BA - General Mathematics http://www.springerreference.com/docs/ navigation .do?m=Encyclopedia+of+Applied+and+Computational+Mathematics+%28Mathematics+and+Statistics%29-book224
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.
Asymptotic properties of solutions of some iterative functional inequalities
Dobiesław Brydak; Bogdan Choczewski; Marek Czerni
2008-01-01
Continuous solutions of iterative linear inequalities of the first and second order are considered, belonging to a class \\(\\mathcal{F}_T\\) of functions behaving at the origin as a prescribed function \\(T\\).
Chang Shih-sen
2008-01-01
Full Text Available Abstract In this paper, a new implicit iteration process with errors for finite families of strictly asymptotically pseudocontractive mappings and nonexpansive mappings is introduced. By using the iterative process, some strong convergence theorems to approximating a common fixed point of strictly asymptotically pseudocontractive mappings and nonexpansive mappings are proved. The results presented in the paper are new which extend and improve some recent results of Osilike et al. (2007, Liu (1996, Osilike (2004, Su and Li (2006, Gu (2007, Xu and Ori (2001.
Large Deviations and Asymptotic Methods in Finance
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...
Jung Jong Soo
2007-01-01
Full Text Available Strong and weak convergence theorems for multistep iterative scheme with errors for finite family of asymptotically nonexpansive mappings are established in Banach spaces. Our results extend and improve the corresponding results of Chidume and Ali (2007, Cho et al. (2004, Khan and Fukhar-ud-din (2005, Plubtieng et al.(2006, Xu and Noor (2002, and many others.
Zhou, H. Y.; Cho, Y. J.; Kang, S. M.
2007-01-01
Suppose that is a nonempty closed convex subset of a real uniformly convex and smooth Banach space with as a sunny nonexpansive retraction. Let be two weakly inward and asymptotically nonexpansive mappings with respect to with sequences , , respectively. Suppose that is a sequence in generated iteratively by , , for all , where , , and are three real sequences in for some which satisfy condition . Then, we have the following. (1) If one of and is completely continuous or demicomp...
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.
Viscosity Approximation Method for Infinitely Many Asymptotically Nonexpansive Maps in Banach Spaces
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.
Quantum defect theory and asymptotic methods
It is shown that quantum defect theory provides a basis for the development of various analytical methods for the examination of electron-ion collision phenomena, including di-electronic recombination. Its use in conjuction with ab initio calculations is shown to be restricted by problems which arise from the presence of long-range non-Coulomb potentials. Empirical fitting to some formulae can be efficient in the use of computer time but extravagant in the use of person time. Calculations at a large number of energy points which make no use of analytical formulae for resonance structures may be made less extravagant in computer time by the development of more efficient asymptotic methods. (U.K.)
Asymptotic methods in mechanics of solids
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...
Iterative methods for mixed finite element equations
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.
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.
New concurrent iterative methods with monotonic convergence
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.
Iterative Runge–Kutta-type methods for nonlinear ill-posed problems
We present a regularization method for solving nonlinear ill-posed problems by applying the family of Runge–Kutta methods to an initial value problem, in particular, to the asymptotical regularization method. We prove that the developed iterative regularization method converges to a solution under certain conditions and with a general stopping rule. Some particular iterative regularization methods are numerically implemented. Numerical results of the examples show that the developed Runge–Kutta-type regularization methods yield stable solutions and that particular implicit methods are very efficient in saving iteration steps
Asymptotic-induced numerical methods for conservation laws
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.
ASYMPTOTICALLY OPTIMAL SUCCESSIVE OVERRELAXATION METHODS FOR SYSTEMS OF LINEAR EQUATIONS
Zhong-zhi Bai; Xue-bin Chi
2003-01-01
We present a class of asymptotically optimal successive overrelaxation methods forsolving the large sparse system of linear equations. Numerical computations show thatthese new methods are more efficient and robust than the classical successive overrelaxationmethod.
Iterative methods for weighted least-squares
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.
Robust methods and asymptotic theory in nonlinear econometrics
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 ...
Asymptotics for maximum score method under general conditions
Taisuke Otsu; Myung Hwan Seo
2014-01-01
Abstract. Since Manski's (1975) seminal work, the maximum score method for discrete choice models has been applied to various econometric problems. Kim and Pollard (1990) established the cube root asymptotics for the maximum score estimator. Since then, however, econometricians posed several open questions and conjectures in the course of generalizing the maximum score approach, such as (a) asymptotic distribution of the conditional maximum score estimator for a panel data dynamic discrete ch...
Iterative Method for Generating Correlated Binary Sequences
Usatenko, O V; Apostolov, S S; Makarov, N M; Krokhin, A A
2014-01-01
We propose a new efficient iterative method for generating random correlated binary sequences with prescribed correlation function. The method is based on consecutive linear modulations of initially uncorrelated sequence into a correlated one. Each step of modulation increases the correlations until the desired level has been reached. Robustness and efficiency for the proposed algorithm are tested by generating sequences with inverse power-law correlations. The substantial increase in the strength of correlation in the iterative method with respect to the single-step filtering generation is shown for all studied correlation functions. Our results can be used for design of disordered superlattices, waveguides, and surfaces with selective transport properties.
Iterative Regularization with Minimum-Residual Methods
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...
Iterative regularization with minimum-residual methods
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...
An Iterative Method for Problems with Multiscale Conductivity
Hyea Hyun Kim
2012-01-01
Full Text Available A model with its conductivity varying highly across a very thin layer will be considered. It is related to a stable phantom model, which is invented to generate a certain apparent conductivity inside a region surrounded by a thin cylinder with holes. The thin cylinder is an insulator and both inside and outside the thin cylinderare filled with the same saline. The injected current can enter only through the holes adopted to the thin cylinder. The model has a high contrast of conductivity discontinuity across the thin cylinder and the thickness of the layer and the size of holes are very small compared to the domain of the model problem. Numerical methods for such a model require a very fine mesh near the thin layer to resolve the conductivity discontinuity. In this work, an efficient numerical method for such a model problem is proposed by employing a uniform mesh, which need not resolve the conductivity discontinuity. The discrete problem is then solved by an iterative method, where the solution is improved by solving a simple discrete problem with a uniform conductivity. At each iteration, the right-hand side is updated by integrating the previous iterate over the thin cylinder. This process results in a certain smoothing effect on microscopic structures and our discrete model can provide a more practical tool for simulating the apparent conductivity. The convergence of the iterative method is analyzed regarding the contrast in the conductivity and the relative thickness of the layer. In numerical experiments, solutions of our method are compared to reference solutions obtained from COMSOL, where very fine meshes are used to resolve the conductivity discontinuity in the model. Errors of the voltage in L2 norm follow O(h asymptotically and the current density matches quitewell those from the reference solution for a sufficiently small mesh size h. The experimental results present a promising feature of our approach for simulating the apparent
Non-iterative method for camera calibration.
Hong, Yuzhen; Ren, Guoqiang; Liu, Enhai
2015-09-01
This paper presents a new and effective technique to calibrate a camera without nonlinear iteration optimization. To this end, the centre-of-distortion is accurately estimated firstly. Based on the radial distortion division model, point correspondences between model plane and its image were used to compute the homography and distortion coefficients afterwards. Once the homographies of calibration images are obtained, the camera intrinsic parameters are solved analytically. All the solution techniques applied in this calibration process are non-iterative that do not need any initial guess, with no risk of local minima. Moreover, estimation of the distortion coefficients and intrinsic parameters could be successfully decoupled, yielding the more stable and reliable result. Both simulative and real experiments have been carried out to show that the proposed method is reliable and effective. Without nonlinear iteration optimization, the proposed method is computationally efficient and can be applied to real-time online calibration. PMID:26368490
Preconditioned iterative methods for partial differential equations
Leaf, G.K.; Minkoff, M.; Diaz, J.C.
1987-01-01
In this paper we consider several preconditioners and iterative methods for solving the linear algebraic system associated with a partial differential equation. Our interest stems from earlier work in Method of Lines (MOL) software for solving kinetics-diffusion equations and a recognition that the solution of the underlying linear system at each timestep is crucial in terms of computational storage and time. We are interested in developing an approach to handle nonsymmetric matrices so that we can deal with convective terms in the partial differential equation (PDE). To examine our methods we consider a model problem which has been used in related work. With regard to the approach there are two aspects: the preconditioner and the iterative method. Among the preconditioners considered are normal form LU factorization and variations related to approximate inverses. The iterative methods include normal form conjugate gradients and related nonsymmetric methods (ORTHOMIN and ORTHODIR). We have found that the use of either an approximate LU factorization or an approximate inverse in combination with normal form conjugate gradient iteration provides an effective approach for solving our model problem. This result suggests potential use of approximate inverses for parallel computation. 5 refs., 4 figs.
Selected asymptotic methods with applications to electromagnetics and antennas
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
Preconditioning of iterative methods - theory and applications
Axelsson, Owe; Blaheta, Radim; Neytcheva, M.; Pultarová, I.
2015-01-01
Roč. 22, č. 6 (2015), s. 901-902. ISSN 1070-5325 Institutional support: RVO:68145535 Keywords : preconditioning * iterative methods * applications Subject RIV: BA - General Mathematics Impact factor: 1.322, year: 2014 http://onlinelibrary.wiley.com/doi/10.1002/nla.2016/epdf
Iterative Brinkman penalization for remeshed vortex methods
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...... 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....
Coherent anomaly and asymptotic method in cooperative phenomena
A new general method is proposed to study asymptotic behaviors of cooperative systems. This is based on the appearance of ''coherent anomaly'' in mean-field-type approximations of cooperative systems. This is powerful in evaluating non-classical scaling exponents of cooperative phenomena. (author)
An Extension of the Optimal Homotopy Asymptotic Method to Coupled Schrödinger-KdV Equation
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.
Asymptotic-Preserving methods and multiscale models for plasma physics
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.
Asymptotic-Preserving methods and multiscale models for plasma physics
Degond, Pierre; Deluzet, Fabrice
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 dif...
Conformal symmetries of gravity from asymptotic methods: further developments
Lambert, Pierre-Henry
2014-01-01
In this thesis, the symmetry structure of gravitational theories at null infinity is studied further, in the case of pure gravity in four dimensions and also in the case of Einstein-Yang-Mills theory in $d$ dimensions with and without a cosmological constant. The first part of this thesis is devoted to the presentation of asymptotic methods (symmetries, solution space and surface charges) applied to gravity in the case of the BMS gauge in three and four spacetime dimensions. The second part of this thesis contains the original contributions. Firstly, it is shown that the enhancement from Lorentz to Virasoro algebra also occurs for asymptotically flat spacetimes defined in the sense of Newman-Unti. As a first application, the transformation laws of the Newman-Penrose coefficients characterizing solution space of the Newman-Unti approach are worked out, focusing on the inhomogeneous terms that contain the information about central extensions of the theory. These transformations laws make the conformal structure...
Iterative Methods for MPC on Graphical Processing Units
Gade-Nielsen, Nicolai Fog; Jørgensen, John Bagterp; Dammann, Bernd
2012-01-01
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...
A short remark on fractional variational iteration method
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.
A short remark on fractional variational iteration method
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.
AIR Tools - A MATLAB package of algebraic iterative reconstruction methods
Hansen, Per Christian; Saxild-Hansen, Maria
2012-01-01
implemented: Algebraic Reconstruction Techniques (ART) and Simultaneous Iterative Reconstruction Techniques (SIRT). In addition we provide a few simplified test problems from medical and seismic tomography. For each iterative method, a number of strategies are available for choosing the relaxation parameter...
Nonlinear vibrations of buckled plates by an asymptotic numerical method
Benchouaf, Lahcen; Boutyour, El Hassan
2016-03-01
This work deals with nonlinear vibrations of a buckled von Karman plate by an asymptotic numerical method and harmonic balance approach. The coupled nonlinear static and dynamic problems are transformed into a sequence of linear ones solved by a finite-element method. The static behavior of the plate is first computed. The fundamental frequency of nonlinear vibrations of the plate, about any equilibrium state, is obtained. To improve the validity range of the power series, Padé approximants are incorporated. A continuation technique is used to get the whole solution. To show the effectiveness of the proposed methodology, numerical tests are presented.
Asymptotic stability properties of θ-methods for delay differential equations
无
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.
Extension to the integral transport equation of an iterative method
Jehouani, A. [EPRA, Department of Physics, Faculty of Sciences, Semlalia, PO Box 2390, 40000 Marrakech (Morocco)]. E-mail: jehouani@ucam.ac.ma; Elmorabiti, A. [Centre d' Etudes Nucleaires de Maamoura, CNESTEN (Morocco); Ghassoun, J. [EPRA, Department of Physics, Faculty of Sciences, Semlalia, PO Box 2390, 40000 Marrakech (Morocco)
2006-09-15
In this paper we describe an extension to the neutron integral transport equation of an iterative method. Indeed an iterative scheme is used for both energy and space including external iteration for the multiplication factor and internal iteration for flux calculations. The Monte Carlo method is used to evaluate the spatial transfer integrals. The results were compared with those obtained by using the APOLLO2 code for a cylindrical cell.
Extension to the integral transport equation of an iterative method
In this paper we describe an extension to the neutron integral transport equation of an iterative method. Indeed an iterative scheme is used for both energy and space including external iteration for the multiplication factor and internal iteration for flux calculations. The Monte Carlo method is used to evaluate the spatial transfer integrals. The results were compared with those obtained by using the APOLLO2 code for a cylindrical cell
An Iterative Tikhonov Method for Large Scale Computations
Loli Piccolomini, Elena; Zama, Fabiana
2009-01-01
In this paper we present an iterative method for the minimization of the Tikhonov regularization functional in the absence of information about noise. Each algorithm iteration updates both the estimate of the regularization parameter and the Tikhonov solution. In order to reduce the number of iterations, an inexact version of the algorithm is also proposed. In this case the inner Conjugate Gradient (CG) iterations are truncated before convergence. In the numerical experi...
Iterative Method for Intrinsic Viscosity Measurements on Perpendicular Recording Media
Kim, Phan Le; Lodder, Cock
2002-01-01
We introduce a new method that allows one to directly measure the intrinsic viscosity (S/sub i/) for perpendicular media using a vibrating sample magnetometer. The measurement is carried out in a number of iterations. In each iteration, the behavior of applied field (H/sub a/) with time is gradually adjusted according to the change in the internal field (H/sub i/) calculated from the relaxation behavior measured in the previous iteration. Eventually, during the last iteration, from which the ...
Iterative methods for Toeplitz-like matrices
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.
An Efficient Bayesian Iterative Method for Solving Linear Systems
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.
Solving the Kuramoto-Sivashinsky equation via Variational Iteration Method
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.
Asymptotic solution for EI Nino-southern oscillation of nonlinear model
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.
Fields Institute International Symposium on Asymptotic Methods in Stochastics
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.
A Parallel Iterative Method for Computing Molecular Absorption Spectra
Koval, Peter; Foerster, Dietrich; Coulaud, Olivier
2010-01-01
We describe a fast parallel iterative method for computing molecular absorption spectra within TDDFT linear response and using the LCAO method. We use a local basis of "dominant products" to parametrize the space of orbital products that occur in the LCAO approach. In this basis, the dynamical polarizability is computed iteratively within an appropriate Krylov subspace. The iterative procedure uses a a matrix-free GMRES method to determine the (interacting) density response. The resulting cod...
Regularization and Iterative Methods for Monotone Variational Inequalities
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.
On the asymptotic methods for nuclear collective models
Gheorghe, A. C.; Raduta, A. A.
2009-01-01
Contractions of orthogonal groups to Euclidean groups are applied to analytic descriptions of nuclear quantum phase transitions. The semiclassical asymptotic of multipole collective Hamiltonians are also investigated.
An iterative method for indefinite systems of linear equations
Ito, K.
1984-01-01
An iterative method for solving nonsymmetric indefinite linear systems is proposed. The method involves the successive use of a modified version of the conjugate residual method. A numerical example is given to illustrate the method.
THE CONVERGENCE BEHAVIOR OF ITERATIVE METHODS ON SEVERELY STRETCHED GRIDS
BOTTA, EFF; WUBS, FW
1993-01-01
In this paper we examine the dramatic influence that a severe stretching of finite difference grids can have on the convergence behaviour of iterative methods. For the most important classes of iterative methods this phenomenon is considered for a simple model problem with various boundary condition
Asymptotic Method for Cladding Stress Evaluation in PCMI
A PCMI (Pellet Cladding Mechanical Interaction) failure was first reported in the GETR (General Electric Test Reactor) at Vacellitos in 1963, and such failures are still occurring. Since the high stress values in the cladding tube has been of a crucial concern in PCMI studies, there have been many researches on the stress analysis of a cladding tube pressed by a pellet. Typical works can be found in some references. It has often been assumed, however, that the cracks in the pellet were equally spaced and the pellet was a rigid body. In addition, the friction coefficient was arbitrarily chosen so that a slipping between the pellets and cladding tube could not be logically defined. Moreover, the stress intensification due to the sharp edge of a pellet fragment has never been realistically considered. These problems above drove us to launch a framework of a PCMI study particularly on stress analysis technology to improve the present analysis method incorporating the actual PCMI conditions such as the stress intensification, arbitrary distribution of the pellet cracks, material properties (esp. pellet) and slipping behavior of the pellet/cladding interface. As a first step of this work, this paper introduces an asymptotic method that was originally developed for a stress analysis in the vicinity of a sharp notch of a homogeneous body. The intrinsic reason for applying this method is to simulate the stress singularity that is expected to take place at the sharp edge of a pellet fragment due to cracking during irradiation. As a first attempt of this work, an eigenvalue problem is formulated in the case of adhered contact, and the generalized stress intensity factors are defined and evaluated. Although some works obviously remain to be accomplished, for the present framework on the PCMI analysis (e. g., slipping behaviour, contact force etc.), it was addressed that the asymptotic method can produce the stress values that cause the cladding tube failure in PCMI more
New Parallel Three-level Iterative Method for Diffusion Equation
Tinghuai Ma
2010-01-01
Full Text Available To solve the diffusion equation on parallel computers, we first derived an o(τ2+h6 order implicit finite difference method based on a class of alternating group explicit iterative method. Based on this method, we devised a new alternating group explicit iterative method. Moreover, the absolute stability and convergence of the New Alternating Group Explicit Iterative (N-AGEI method was proved. Finally, the numerical experiments were conducted to verify our method. Both the theoretical analysis and simulation results showed that our proposed difference format had satisfied stability error estimate and convergence.
Leapfrog variants of iterative methods for linear algebra equations
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.
Parallel iterative methods for sparse linear and nonlinear equations
Saad, Youcef
1989-01-01
As three-dimensional models are gaining importance, iterative methods will become almost mandatory. Among these, preconditioned Krylov subspace methods have been viewed as the most efficient and reliable, when solving linear as well as nonlinear systems of equations. There has been several different approaches taken to adapt iterative methods for supercomputers. Some of these approaches are discussed and the methods that deal more specifically with general unstructured sparse matrices, such as those arising from finite element methods, are emphasized.
Reducing the latency of the Fractal Iterative Method to half an iteration
Béchet, Clémentine; Tallon, Michel
2013-12-01
The fractal iterative method for atmospheric tomography (FRiM-3D) has been introduced to solve the wavefront reconstruction at the dimensions of an ELT with a low-computational cost. Previous studies reported the requirement of only 3 iterations of the algorithm in order to provide the best adaptive optics (AO) performance. Nevertheless, any iterative method in adaptive optics suffer from the intrinsic latency induced by the fact that one iteration can start only once the previous one is completed. Iterations hardly match the low-latency requirement of the AO real-time computer. We present here a new approach to avoid iterations in the computation of the commands with FRiM-3D, thus allowing low-latency AO response even at the scale of the European ELT (E-ELT). The method highlights the importance of "warm-start" strategy in adaptive optics. To our knowledge, this particular way to use the "warm-start" has not been reported before. Futhermore, removing the requirement of iterating to compute the commands, the computational cost of the reconstruction with FRiM-3D can be simplified and at least reduced to half the computational cost of a classical iteration. Thanks to simulations of both single-conjugate and multi-conjugate AO for the E-ELT,with FRiM-3D on Octopus ESO simulator, we demonstrate the benefit of this approach. We finally enhance the robustness of this new implementation with respect to increasing measurement noise, wind speed and even modeling errors.
Iteration of Runge-Kutta methods with block triangular Jacobians
Houwen, P.J. van der; Sommeijer, B.P.
1995-01-01
We shall consider iteration processes for solving the implicit relations associated with implicit Runge-Kutta (RK) methods applied to stiff initial value problems (IVPs). The conventional approach for solving the RK equations uses Newton iteration employing the full righthand side Jacobian. For IVPs
Iterative Method for Intrinsic Viscosity Measurements on Perpendicular Recording Media
Kim, Phan Le; Lodder, Cock
2002-01-01
We introduce a new method that allows one to directly measure the intrinsic viscosity (S/sub i/) for perpendicular media using a vibrating sample magnetometer. The measurement is carried out in a number of iterations. In each iteration, the behavior of applied field (H/sub a/) with time is gradually
Iterative Refinement Methods for Time-Domain Equalizer Design
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.
Multi-Level iterative methods in computational plasma physics
Plasma physics phenomena occur on a wide range of spatial scales and on a wide range of time scales. When attempting to model plasma physics problems numerically the authors are inevitably faced with the need for both fine spatial resolution (fine grids) and implicit time integration methods. Fine grids can tax the efficiency of iterative methods and large time steps can challenge the robustness of iterative methods. To meet these challenges they are developing a hybrid approach where multigrid methods are used as preconditioners to Krylov subspace based iterative methods such as conjugate gradients or GMRES. For nonlinear problems they apply multigrid preconditioning to a matrix-few Newton-GMRES method. Results are presented for application of these multilevel iterative methods to the field solves in implicit moment method PIC, multidimensional nonlinear Fokker-Planck problems, and their initial efforts in particle MHD
MULTILEVEL ITERATION METHODS FOR SOLVING LINEAR ILL-POSED PROBLEMS
无
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.
Approximate inverse preconditioning of iterative methods for nonsymmetric linear systems
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.
A WEIGHTED ITERATIVE METHOD FOR ROBUST SELF-CALIBRATION
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.
Iterative regularization methods for nonlinear ill-posed problems
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.
Arablouei, Reza; Doğançay, Kutluyıl; Werner, Stefan
2014-01-01
We develop a recursive total least-squares (RTLS) algorithm for errors-in-variables system identification utilizing the inverse power method and the dichotomous coordinate-descent (DCD) iterations. The proposed algorithm, called DCD-RTLS, outperforms the previously-proposed RTLS algorithms, which are based on the line-search method, with reduced computational complexity. We perform a comprehensive analysis of the DCD-RTLS algorithm and show that it is asymptotically unbiased as well as being ...
BOUNDEDNESS AND ASYMPTOTIC STABILITY OF MULTISTEP METHODS FOR GENERALIZED PANTOGRAPH EQUATIONS
Cheng-jian Zhang; Geng Sun
2004-01-01
In this paper, we deal with the boundedness and the asymptotic stability of linear and one-leg multistep methods for generalized pantograph equations of neutral type, which arise from some fields of engineering. Some criteria of the boundedness and the asymptotic stability for the methods are obtained.
Explanation of Second-Order Asymptotic Theory Via Information Spectrum Method
Hayashi, Masahito
We explain second-order asymptotic theory via the information spectrum method. From a unified viewpoint based on the generality of the information spectrum method, we consider second-order asymptotic theory for use in fixed-length data compression, uniform random number generation, and channel coding. Additionally, we discuss its application to quantum cryptography, folklore in source coding, and security analysis.
Conference on iterative methods for large linear systems
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.
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.
ACCELERATION METHODS OF NONLINEAR ITERATION FOR NONLINEAR PARABOLIC EQUATIONS
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.
Multicore Performance of Block Algebraic Iterative Reconstruction Methods
Sørensen, Hans Henrik B.; Hansen, Per Christian
2014-01-01
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......, and those that compute a result for each block in parallel and then combine these results before the next iteration. The goal of this work is to demonstrate which block methods are best suited for implementation on modern multicore computers. To compare the performance of the different block methods......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...
An Iterative Brinkman penalization for particle vortex methods
Walther, Jens Honore; Hejlesen, Mads Mølholm; Leonard, A.; Koumoutsakos, P.
2013-01-01
We present an iterative Brinkman penalization method for the enforcement of the no-slip boundary condition in vortex particle methods. This is achieved by implementing a penalization of the velocity field using iteration of the penalized vorticity. We show that using the conventional Brinkman...... condition. These are: the impulsively started flow past a cylinder, the impulsively started flow normal to a flat plate, and the uniformly accelerated flow normal to a flat plate. The iterative penalization algorithm is shown to give significantly improved results compared to the conventional penalization...
The renormalization method based on the Taylor expansion and applications for asymptotic analysis
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...
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
An Iterative Method for Extracting Chinese Unknown Words
HE Shan; ZHU Jie
2001-01-01
An iterative method for extractingunknown words from a Chinese text corpus is pro-posed in this paper. Unlike traditional non-iterativesegmentation-detection approaches, which use onlyknown words for segmentation, the proposed methoditeratively extracts new words and adds them into thelexicon. Then the augmented dictionary, which in-cludes known words and potential unknown words, isused in the next iteration to re-segment the input cor-pus. Experiments show that both the precision andrecall rates of segmentation are improved.
Iteration of Runge-Kutta methods with block triangular Jacobians
Houwen, van der, P.J.; Sommeijer, Ben
1995-01-01
We shall consider iteration processes for solving the implicit relations associated with implicit Runge-Kutta (RK) methods applied to stiff initial value problems (IVPs). The conventional approach for solving the RK equations uses Newton iteration employing the full righthand side Jacobian. For IVPs of large dimension, this approach is not attractive because of the high costs involved in the LU-decomposition of the Jacobian of the RK equations. Several proposals have been made to reduce these...
Mathematical justification of Kelvin-Voigt beam models by asymptotic methods
Rodríguez-Arós, Á. D.; Viaño, J. M.
2012-06-01
The authors derive and justify two models for the bending-stretching of a viscoelastic rod by using the asymptotic expansion method. The material behaviour is modelled by using a general Kelvin-Voigt constitutive law.
MODIFIED BERNOULLI ITERATION METHODS FOR QUADRATIC MATRIX EQUATION
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.
Preconditioning methods for improved convergence rates in iterative reconstructions
Because of the characteristics of the tomographic inversion problem, iterative reconstruction techniques often suffer from poor convergence rates--especially at high spatial frequencies. By using preconditioning methods, the convergence properties of most iterative methods can be greatly enhanced without changing their ultimate solution. To increase reconstruction speed, the authors have applied spatially-invariant preconditioning filters that can be designed using the tomographic system response and implemented using 2-D frequency-domain filtering techniques. In a sample application, the authors performed reconstructions from noiseless, simulated projection data, using preconditioned and conventional steepest-descent algorithms. The preconditioned methods demonstrated residuals that were up to a factor of 30 lower than the unassisted algorithms at the same iteration. Applications of these methods to regularized reconstructions from projection data containing Poisson noise showed similar, although not as dramatic, behavior
Yarmukhamedov, R. [Institute of Nuclear Physics, Academy of Sciences of Uzbekistan, 100214 Tashkent (Uzbekistan)
2014-05-09
The basic methods of the determination of asymptotic normalization coefficient for A+a→B of astrophysical interest are briefly presented. The results of the application of the specific asymptotic normalization coefficients derived within these methods for the extrapolation of the astrophysical S factors to experimentally inaccessible energy regions (E ≤ 25 keV) for the some specific radiative capture A(a,γ)B reactions of the pp-chain and the CNO cycle are presented.
Asymptotic solving method for a sea—air oscillator model of atmospheric physics
In this paper, a class of coupled system for the El Niño/La Niña southern oscillation (ENSO) atmospheric physics oscillation model is considered. We propose an ENSO atmospheric physics model using a method from the asymptotic theory. It is indicated from the results that the asymptotic method can be used for analyzing the sea surface temperature anomaly and the thermocline depth anomaly of the atmosphere—ocean oscillation for the ENSO model in the equatorial Pacific. (general)
Shadow boundary effects in hybrid numerical-asymptotic methods for high frequency scattering
Hewett, David P.
2014-01-01
The hybrid numerical-asymptotic (HNA) approach aims to reduce the computational cost of conventional numerical methods for high frequency wave scattering problems by enriching the numerical approximation space with oscillatory basis functions, chosen based on partial knowledge of the high frequency solution asymptotics. In this paper we propose a new methodology for the treatment of shadow boundary effects in HNA boundary element methods, using the classical geometrical theory of diffraction ...
Natural Preconditioning and Iterative Methods for Saddle Point Systems
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.
Milestones in the Development of Iterative Solution Methods
Axelsson, Owe
2010-01-01
Roč. 2010, - (2010), s. 1-33. ISSN 2090-0147 Institutional research plan: CEZ:AV0Z30860518 Keywords : iterative solution methods * convergence acceleration methods * linear systems Subject RIV: JC - Computer Hardware ; Software http://www.hindawi.com/journals/jece/2010/972794.html
Analysis of the electrical conduction using an iterative method
Dziuba, Z.; Górska, M.
1992-01-01
An iterative method for transforming the electrical conduction versus magnetic field $\\hat{\\sigma}\\,(H)$ into the mobility spectrum of the electrical conduction density s (μ) is presented. The mobility spectrum is a new form of presentation of carrier parameters. The method is especially useful in the analysis of a mixed conduction in semiconductors like HgCdTe or in quantum well systems.
The renormalization method based on the Taylor expansion and applications for asymptotic analysis
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...
COMPARISON OF HOLOGRAPHIC AND ITERATIVE METHODS FOR AMPLITUDE OBJECT RECONSTRUCTION
I. A. Shevkunov
2015-01-01
Full Text Available Experimental comparison of four methods for the wavefront reconstruction is presented. We considered two iterative and two holographic methods with different mathematical models and algorithms for recovery. The first two of these methods do not use a reference wave recording scheme that reduces requirements for stability of the installation. A major role in phase information reconstruction by such methods is played by a set of spatial intensity distributions, which are recorded as the recording matrix is being moved along the optical axis. The obtained data are used consistently for wavefront reconstruction using an iterative procedure. In the course of this procedure numerical distribution of the wavefront between the planes is performed. Thus, phase information of the wavefront is stored in every plane and calculated amplitude distributions are replaced for the measured ones in these planes. In the first of the compared methods, a two-dimensional Fresnel transform and iterative calculation in the object plane are used as a mathematical model. In the second approach, an angular spectrum method is used for numerical wavefront propagation, and the iterative calculation is carried out only between closely located planes of data registration. Two digital holography methods, based on the usage of the reference wave in the recording scheme and differing from each other by numerical reconstruction algorithm of digital holograms, are compared with the first two methods. The comparison proved that the iterative method based on 2D Fresnel transform gives results comparable with the result of common holographic method with the Fourier-filtering. It is shown that holographic method for reconstructing of the object complex amplitude in the process of the object amplitude reduction is the best among considered ones.
Approximate iterative operator method for potential-field downward continuation
Tai, Zhenhua; Zhang, Fengxu; Zhang, Fengqin; Hao, Mengcheng
2016-05-01
An approximate iterative operator method in wavenumber domain was proposed to improve the stability and accuracy of downward continuation of potential fields measured from the ground surface, marine or airborne. Firstly, the generalized iterative formula of downward continuation is derived in wavenumber domain; then, the transformational relationship between horizontal second-order partial derivatives and continuation is derived based on the Taylor series and Laplace equation, to obtain an approximate operator. By introducing this operator to the generalized iterative formula, a rapid algorithm is developed for downward continuation. The filtering and convergence characteristics of this method are analyzed for the purpose of estimating the optimal interval of number of iterations. We demonstrate the proposed method on synthetic data, and the results validate the flexibility of the proposed method. At last, we apply the proposed method to real data, and the results show the proposed method can enhance gravity anomalies generated by concealed orebodies. And in the contour obtained by making our proposed method results continue upward to measured level, the numerical results have approximate distribution and amplitude with original anomalies.
APPLICATIONS OF STAIR MATRICES AND THEIR GENERALIZATIONS TO ITERATIVE METHODS
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.
Variational iteration method for solving compressible Euler equations
This paper applies the variational iteration method to obtain approximate analytic solutions of compressible Euler equations in gas dynamics. This method is based on the use of Lagrange multiplier for identification of optimal values of parameters in a functional. Using this method, a rapid convergent sequence is produced which converges to the exact solutions of the problem. Numerical results and comparison with other two numerical solutions verify that this method is very convenient and efficient. (general)
A New Iterative Method to Calculate [pi
Dion, Peter; Ho, Anthony
2012-01-01
For at least 2000 years people have been trying to calculate the value of [pi], the ratio of the circumference to the diameter of a circle. People know that [pi] is an irrational number; its decimal representation goes on forever. Early methods were geometric, involving the use of inscribed and circumscribed polygons of a circle. However, real…
Scattering from a multilayered chiral sphere using an iterative method
Shang, Qing-Chao; Wu, Zhen-Sen; Qu, Tan; Li, Zheng-Jun; Bai, Lu
2016-04-01
An iterative method for electromagnetic scattering from a multilayered chiral sphere is presented based on Lorenz-Mie regime. Electromagnetic fields in each region are expanded in terms of spherical vector wave functions. To calculate the scattering coefficients of the fields in outer space, an iterative form is constructed according to the coefficients equations obtained by the boundary condition on each layer. The iterative relations are expressed in forms of ratios and logarithmic derivatives of Riccati-Bessel functions, which can be calculated conveniently by their recurrence relations. The theory and codes are verified by comparing the scattered fields with those of a multilayered isotropic achiral sphere, and those of a single layered chiral sphere. Scattered fields of multilayered chiral spheres are presented and discussed, including a large sized case and a Gaussian beam incidence case.
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.
Preconditioned Iterative Methods for Solving Weighted Linear Least Squares Problems
Bru, R.; Marín, J.; Mas, J.; Tůma, Miroslav
2014-01-01
Roč. 36, č. 4 (2014), A2002-A2022. ISSN 1064-8275 Institutional support: RVO:67985807 Keywords : preconditioned iterative methods * incomplete decompositions * approximate inverses * linear least squares Subject RIV: BA - General Mathematics Impact factor: 1.854, year: 2014
A Picard-S hybrid type iteration method for solving a differential equation with retarded argument
Gürsoy, Faik; Karakaya, Vatan
2014-01-01
We introduce a new iteration method called Picard-S iteration. We show that the Picard-S iteration method can be used to approximate fixed point of contraction mappings. Also, we show that our new iteration method is equivalent and converges faster than CR iteration method for the aforementioned class of mappings. Furthermore, by providing an example, it is shown that the Picard-S iteration method converges faster than all Picard, Mann, Ishikawa, Noor, SP, CR, S and some other iteration metho...
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.
Soft Error Vulnerability of Iterative Linear Algebra Methods
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.
Variational Iteration Method for a Fractional-Order Brusselator System
H. Jafari
2014-01-01
Full Text Available This paper presents approximate analytical solutions for the fractional-order Brusselator system using the variational iteration method. The fractional derivatives are described in the Caputo sense. This method is based on the incorporation of the correction functional for the equation. Two examples are solved as illustrations, using symbolic computation. The numerical results show that the introduced approach is a promising tool for solving system of linear and nonlinear fractional differential equations.
Iteration Complexity Analysis of Block Coordinate Descent Methods
Hong, Mingyi; Wang, Xiangfeng; Razaviyayn, Meisam; Luo, Zhi-Quan
2013-01-01
In this paper, we provide a unified iteration complexity analysis for a family of general block coordinate descent (BCD) methods, covering popular methods such as the block coordinate gradient descent (BCGD) and the block coordinate proximal gradient (BCPG), under various different coordinate update rules. We unify these algorithms under the so-called Block Successive Upper-bound Minimization (BSUM) framework, and show that for a broad class of multi-block nonsmooth convex problems, all algor...
Object-oriented design of preconditioned iterative methods
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.
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...
A Parallel Iterative Method for Computing Molecular Absorption Spectra.
Koval, Peter; Foerster, Dietrich; Coulaud, Olivier
2010-09-14
We describe a fast parallel iterative method for computing molecular absorption spectra within TDDFT linear response and using the LCAO method. We use a local basis of "dominant products" to parametrize the space of orbital products that occur in the LCAO approach. In this basis, the dynamic polarizability is computed iteratively within an appropriate Krylov subspace. The iterative procedure uses a matrix-free GMRES method to determine the (interacting) density response. The resulting code is about 1 order of magnitude faster than our previous full-matrix method. This acceleration makes the speed of our TDDFT code comparable with codes based on Casida's equation. The implementation of our method uses hybrid MPI and OpenMP parallelization in which load balancing and memory access are optimized. To validate our approach and to establish benchmarks, we compute spectra of large molecules on various types of parallel machines. The methods developed here are fairly general, and we believe they will find useful applications in molecular physics/chemistry, even for problems that are beyond TDDFT, such as organic semiconductors, particularly in photovoltaics. PMID:26616067
Iterative methods for stationary convection-dominated transport problems
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.
Iterative methods for simultaneous inclusion of polynomial zeros
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 ...
Improved criticality convergence via a modified Monte Carlo iteration method
Booth, Thomas E [Los Alamos National Laboratory; Gubernatis, James E [Los Alamos National Laboratory
2009-01-01
Nuclear criticality calculations with Monte Carlo codes are normally done using a power iteration method to obtain the dominant eigenfunction and eigenvalue. In the last few years it has been shown that the power iteration method can be modified to obtain the first two eigenfunctions. This modified power iteration method directly subtracts out the second eigenfunction and thus only powers out the third and higher eigenfunctions. The result is a convergence rate to the dominant eigenfunction being |k{sub 3}|/k{sub 1} instead of |k{sub 2}|/k{sub 1}. One difficulty is that the second eigenfunction contains particles of both positive and negative weights that must sum somehow to maintain the second eigenfunction. Summing negative and positive weights can be done using point detector mechanics, but this sometimes can be quite slow. We show that an approximate cancellation scheme is sufficient to accelerate the convergence to the dominant eigenfunction. A second difficulty is that for some problems the Monte Carlo implementation of the modified power method has some stability problems. We also show that a simple method deals with this in an effective, but ad hoc manner.
Iterative reconstruction methods in X-ray CT.
Beister, Marcel; Kolditz, Daniel; Kalender, Willi A
2012-04-01
Iterative reconstruction (IR) methods have recently re-emerged in transmission x-ray computed tomography (CT). They were successfully used in the early years of CT, but given up when the amount of measured data increased because of the higher computational demands of IR compared to analytical methods. The availability of large computational capacities in normal workstations and the ongoing efforts towards lower doses in CT have changed the situation; IR has become a hot topic for all major vendors of clinical CT systems in the past 5 years. This review strives to provide information on IR methods and aims at interested physicists and physicians already active in the field of CT. We give an overview on the terminology used and an introduction to the most important algorithmic concepts including references for further reading. As a practical example, details on a model-based iterative reconstruction algorithm implemented on a modern graphics adapter (GPU) are presented, followed by application examples for several dedicated CT scanners in order to demonstrate the performance and potential of iterative reconstruction methods. Finally, some general thoughts regarding the advantages and disadvantages of IR methods as well as open points for research in this field are discussed. PMID:22316498
Duality-based Asymptotic-Preserving method for highly anisotropic diffusion equations
Degond, Pierre; Lozinski, Alexei; Narski, Jacek; Negulescu, Claudia
2010-01-01
The present paper introduces an efficient and accurate numerical scheme for the solution of a highly anisotropic elliptic equation, the anisotropy direction being given by a variable vector field. This scheme is based on an asymptotic preserving reformulation of the original system, permitting an accurate resolution independently of the anisotropy strength and without the need of a mesh adapted to this anisotropy. The counterpart of this original procedure is the larger system size, enlarged by adding auxiliary variables and Lagrange multipliers. This Asymptotic-Preserving method generalizes the method investigated in a previous paper [arXiv:0903.4984v2] to the case of an arbitrary anisotropy direction field.
Non-asymptotic fractional order differentiators via an algebraic parametric method
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.
Computation of saddle-type slow manifolds using iterative methods
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...
Direct Determination of Asymptotic Structural Postbuckling Behaviour by the finite element method
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...
Belov, P. A., E-mail: pavelbelov@gmail.com; Yakovlev, S. L., E-mail: yakovlev@cph10.phys.spbu.ru [St. Petersburg State University, Department of Computational Physics (Russian Federation)
2013-02-15
The process of neutron-deuteron scattering at energies above the deuteron-breakup threshold is described within the three-body formalism of Faddeev equations. Use is made of the method of solving Faddeev equations in configuration space on the basis of expanding wave-function components in the asymptotic region in bases of eigenfunctions of specially chosen operators. Asymptotically, wave-function components are represented in the form of an expansion in an orthonormalized basis of functions depending on the hyperangle. This basis makes it possible to orthogonalize the contributions of elastic-scattering and breakup channels. The proposed method permits determining scattering and breakup parameters from the asymptotic representation of the wave function without reconstructing it over the entire configuration space. The scattering and breakup amplitudes for states of total spin S = 1/2 and 3/2 were obtained for the s-wave Faddeev equation.
ASYMPTOTIC STABILITY OF RUNGE-KUTTA METHODS FOR THE PANTOGRAPH EQUATIONS
Jing-jun Zhao; Wan-rong Cao; Ming-zhu Liu
2004-01-01
This paper considers the asymptotic stability analysis of both exact and numericalsolutions of the following neutral delay differential equation with pantograph delay.{x′(t)+Bx(t)+Cx′(qt)+Dx(qt)=0, t>0,x(0)=x0,where B, C, D ∈ Cd×d, q ∈ (0, 1), and B is regular. After transforming the above equation to non-automatic neutral equation with constant delay, we determine sufficient conditions for the asymptotic stability of the zero solution. Furthermore, we focus on the asymptotic stability behavior of Runge-Kutta method with variable stepsize. It is proved that a Lstable Runge-Kutta method can preserve the above-mentioned stability properties.
An Alternating Iterative Method and Its Application in Statistical Inference
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)).
In this article, two reliable techniques, Haar wavelet method and optimal homotopy asymptotic method (OHAM) are presented. Haar wavelet method is an efficient numerical method for the numerical solution of fractional order partial differential equation like Fisher type. The approximate solutions of the fractional Fisher type equation are compared with the optimal homotopy asymptotic method as well as with the exact solutions. Comparisons between the obtained solutions with the exact solutions exhibit that both the featured methods are effective and efficient in solving nonlinear problems. However, the results indicate that OHAM provides more accurate value than Haar wavelet method
On the interplay between inner and outer iterations for a class of iterative methods
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.
Thermal diffusivity identification based on an iterative regularization method
Attar, Lamia; Perez, Laetitia; Nouailletas, Rémy; Moulay, Emmanuel; Autrique, Laurent
2015-01-01
International audience This article deals with the identification of a space and time dependent material thermal diffusivity. Such parameter is involved in heat transfers described by partial differential equations. An iterative regularization method based on a conjugate gradient algorithm is implemented. Such approach is attractive in order to efficiently deal with measurement noises and model errors. Numerical results are illustrated according to severa...
Computation of electron energy loss spectra by an iterative method
Koval, Peter [Donostia International Physics Center (DIPC), Paseo Manuel de Lardizabal 4, E-20018 San Sebastián (Spain); Centro de Física de Materiales CFM-MPC, Centro Mixto CSIC-UPV/EHU, Paseo Manuel de Lardizabal 5, E-20018 San Sebastián (Spain); Ljungberg, Mathias Per [Donostia International Physics Center (DIPC), Paseo Manuel de Lardizabal 4, E-20018 San Sebastián (Spain); Foerster, Dietrich [LOMA, Université de Bordeaux 1, 351 Cours de la Liberation, 33405 Talence (France); Sánchez-Portal, Daniel [Donostia International Physics Center (DIPC), Paseo Manuel de Lardizabal 4, E-20018 San Sebastián (Spain); Centro de Física de Materiales CFM-MPC, Centro Mixto CSIC-UPV/EHU, Paseo Manuel de Lardizabal 5, E-20018 San Sebastián (Spain)
2015-07-01
A method is presented to compute the dielectric function for extended systems using linear response time-dependent density functional theory. Localized basis functions with finite support are used to expand both eigenstates and response functions. The electron-energy loss function is directly obtained by an iterative Krylov-subspace method. We apply our method to graphene and silicon and compare it to plane-wave based approaches. Finally, we compute electron-energy loss spectrum of C{sub 60} crystal to demonstrate the merits of the method for molecular crystals, where it will be most competitive.
Computation of electron energy loss spectra by an iterative method
A method is presented to compute the dielectric function for extended systems using linear response time-dependent density functional theory. Localized basis functions with finite support are used to expand both eigenstates and response functions. The electron-energy loss function is directly obtained by an iterative Krylov-subspace method. We apply our method to graphene and silicon and compare it to plane-wave based approaches. Finally, we compute electron-energy loss spectrum of C60 crystal to demonstrate the merits of the method for molecular crystals, where it will be most competitive
Vahdatirad, Mohammadjavad; Bayat, Mehdi; Andersen, Lars Vabbersgaard; Ibsen, Lars Bo
2015-01-01
The mechanical responses of an offshore monopile foundation mounted in over-consolidated clay are calculated by employing a stochastic approach where a nonlinear p–y curve is incorporated with a finite element scheme. The random field theory is applied to represent a spatial variation for undrained...... 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...
Application of Non-Iterative Method in Image Deblurring
MILADINOVIC Marko
2012-05-01
Full Text Available This paper presents a non-iterative method thatfinds application in a broad scientific field such as imagedeblurring. A method for image deblurring, based on thepseudo-inverse matrix is apply for removal of blurr inan image caused by linear motion. This methodassumes that linear motion corresponds to an integralnumber of pixels. Compared to other classicalmethods, this method attains higher values of theImprovement in Signal to Noise Ratio (ISNRparameter and of the Peak Signal-to-Noise Ratio(PSNR. We give an implementation in the MATLABprogramming package.
Zoom synchrosqueezing transform and iterative demodulation: Methods with application
Cao, Hongrui; Xi, Songtao; Chen, Xuefeng; Wang, Shibin
2016-05-01
Synchrosqueezing is a powerful time-frequency analysis tool for signals with time-varying frequency. However, as it is based on the continuous wavelet transform, its time-frequency representation (TFR) has better time but worse frequency resolution in higher frequency region, while worse time but better frequency resolution in lower frequency region. It makes the synchrosqueezing difficult to accurately estimate IFs with highly oscillating rate but small fluctuation amplitude. To address this issue, a zoom synchrosqueezing transform (ZST) is proposed to generate both excellent time and frequency resolution in a specific frequency region and analyze the mono-component signal in the particular frequency region to obtain accurate IF estimation results. For multi-component signals with nonlinear and close IFs, a ZST based dual iterative demodulation method is proposed, with the inner iteration to gradually refine and accurately extract a concerned mono-component, and the outer iteration to extract all mono-components gradually to alleviate the interference between individual components. Then satisfactory energy concentrated TFRs and accurate IF estimation results of mono-components can be obtained by the proposed ZST. The TFR of the multi-component signal can be gained by superposing the TFRs of all mono-components. The effectiveness of the proposed methods was validated using both simulated signals and a rub-impact signal collected from an engineering machine unit.
Comment on “Variational Iteration Method for Fractional Calculus Using He’s Polynomials”
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.
ASYMPTOTIC BEHAVIOR OF MULTISTEP RUNGE-KUTTA METHODS FOR SYSTEMS OF DELAY DIFFERENTIAL EQUATIONS
张诚坚; 廖晓昕
2001-01-01
This paper deals with the asymptotic behavior of multistep Runge-Kutta methods for systems of delay differential equations (DDEs). With the help of K.J.in't Hout's analytic technique for the numerical stability of onestep Runge-Kutta methods, we obtain that a multistep Runge-Kutta method for DDEs is stable iff the corresponding methods for ODEs is A-stable under suitable interpolation conditions.
Conference on Boundary and Interior Layers : Computational and Asymptotic Methods
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. .
Convergence of Inner-Iteration GMRES Methods for Rank-Deficient Least Squares Problems
Morikuni, Keiichi; Hayami, K.
2015-01-01
Roč. 36, č. 1 (2015), s. 225-250. ISSN 0895-4798 Institutional support: RVO:67985807 Keywords : least squares problem * iterative methods * preconditioner * inner-outer iteration * GMRES method * stationary iterative method * rank-deficient problem Subject RIV: BA - General Mathematics Impact factor: 1.590, year: 2014
AIR: fused Analytical and Iterative Reconstruction method for computed tomography
Yang, Liu; Qi, Sharon X; Gao, Hao
2013-01-01
Purpose: CT image reconstruction techniques have two major categories: analytical reconstruction (AR) method and iterative reconstruction (IR) method. AR reconstructs images through analytical formulas, such as filtered backprojection (FBP) in 2D and Feldkamp-Davis-Kress (FDK) method in 3D, which can be either mathematically exact or approximate. On the other hand, IR is often based on the discrete forward model of X-ray transform and formulated as a minimization problem with some appropriate image regularization method, so that the reconstructed image corresponds to the minimizer of the optimization problem. This work is to investigate the fused analytical and iterative reconstruction (AIR) method. Methods: Based on IR with L1-type image regularization, AIR is formulated with a AR-specific preconditioner in the data fidelity term, which results in the minimal change of the solution algorithm that replaces the adjoint X-ray transform by the filtered X-ray transform. As a proof-of-concept 2D example of AIR, FB...
Ullah, Hakeem; Islam, Saeed; Khan, Ilyas; Shafie, Sharidan; Fiza, Mehreen
2015-01-01
In this paper we applied a new analytic approximate technique Optimal Homotopy Asymptotic Method (OHAM) for treatment of coupled differential- difference equations (DDEs). To see the efficiency and reliability of the method, we consider Relativistic Toda coupled nonlinear differential-difference equation. It provides us a convenient way to control the convergence of approximate solutions when it is compared with other methods of solution found in the literature. The obtained solutions show th...
Parallel computation of multigroup reactivity coefficient using iterative method
One of the research activities to support the commercial radioisotope production program is a safety research target irradiation FPM (Fission Product Molybdenum). FPM targets form a tube made of stainless steel in which the nuclear degrees of superimposed high-enriched uranium. FPM irradiation tube is intended to obtain fission. The fission material widely used in the form of kits in the world of nuclear medicine. Irradiation FPM tube reactor core would interfere with performance. One of the disorders comes from changes in flux or reactivity. It is necessary to study a method for calculating safety terrace ongoing configuration changes during the life of the reactor, making the code faster became an absolute necessity. Neutron safety margin for the research reactor can be reused without modification to the calculation of the reactivity of the reactor, so that is an advantage of using perturbation method. The criticality and flux in multigroup diffusion model was calculate at various irradiation positions in some uranium content. This model has a complex computation. Several parallel algorithms with iterative method have been developed for the sparse and big matrix solution. The Black-Red Gauss Seidel Iteration and the power iteration parallel method can be used to solve multigroup diffusion equation system and calculated the criticality and reactivity coeficient. This research was developed code for reactivity calculation which used one of safety analysis with parallel processing. It can be done more quickly and efficiently by utilizing the parallel processing in the multicore computer. This code was applied for the safety limits calculation of irradiated targets FPM with increment Uranium
Iterative methods for dose reduction and image enhancement in tomography
Miao, Jianwei; Fahimian, Benjamin Pooya
2012-09-18
A system and method for creating a three dimensional cross sectional image of an object by the reconstruction of its projections that have been iteratively refined through modification in object space and Fourier space is disclosed. The invention provides systems and methods for use with any tomographic imaging system that reconstructs an object from its projections. In one embodiment, the invention presents a method to eliminate interpolations present in conventional tomography. The method has been experimentally shown to provide higher resolution and improved image quality parameters over existing approaches. A primary benefit of the method is radiation dose reduction since the invention can produce an image of a desired quality with a fewer number projections than seen with conventional methods.
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.
Non-stationary iterative methods for solving macroeconomic numeric models
Bogdan OANCEA
2006-01-01
Full Text Available Macroeconometric modeling was influenced by the development of new and efficient computational techniques. Rational Expectations models, a particular class of macroeconometric models, give raise to very large systems of equations, the solution of which requires heavy computations. Therefore, such models are an interesting testing ground for the numerical methods addressed in this research. The most difficult problem is to obtain the solution of the linear system that arises during the Newton step. As an alternative to the direct methods, we propose non-stationary iterative methods, also called Krylov methods, to solve these models. Numerical experiments conducted by authors confirm the interesting features of these methods: low computational complexity and storage requirements.
A Matrix Pencil Algorithm Based Multiband Iterative Fusion Imaging Method
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.
Statistics of electron multiplication in a multiplier phototube; Iterative method
In the present paper an iterative method is applied to study the variation of dynode response in the multiplier phototube. Three different situation are considered that correspond to the following ways of electronic incidence on the first dynode: incidence of exactly one electron, incidence of exactly r electrons and incidence of an average r electrons. The responses are given for a number of steps between 1 and 5, and for values of the multiplication factor of 2.1, 2.5, 3 and 5. We study also the variance, the skewness and the excess of jurtosis for different multiplication factors. (Author) 11 refs
Comment on “A New Second-Order Iteration Method for Solving Nonlinear Equations”
Haibin Li
2013-01-01
Full Text Available Kang et al. claimed that they obtained a new iteration formulation for nonlinear algebraic equations; however the “new” formulation was first derived in 2007 by the variational iteration method.
Guoping Xu; Harry Zheng
2010-01-01
In this paper we discuss the basket options valuation for a jump-diffusion model. The underlying asset prices follow some correlated local volatility diffusion processes with systematic jumps. We derive a forward partial integral differential equation (PIDE) for general stochastic processes and use the asymptotic expansion method to approximate the conditional expectation of the stochastic variance associated with the basket value process. The numerical tests show that the suggested method is...
Iterative Reconstruction Methods for Hybrid Inverse Problems in Impedance Tomography
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...
Computer methods for ITER-like materials LIBS diagnostics
Ł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.
FAST NAS-RIF ALGORITHM USING ITERATIVE CONJUGATE GRADIENT METHOD
A.M.Raid
2014-04-01
Full Text Available Many improvements on image enhancemen have been achieved by The Non-negativity And Support constraints Recursive Inverse Filtering (NAS-RIF algorithm. The Deterministic constraints such as non negativity, known finite support, and existence of blur invariant edges are given for the true image. NASRIF algorithms iterative and simultaneously estimate the pixels of the true image and the Point Spread Function (PSF based on conjugate gradients method. NAS-RIF algorithm doesn’t assume parametric models for either the image or the blur, so we update the parameters of conjugate gradient method and the objective function for improving the minimization of the cost function and the time for execution. We propose a different version of linear and nonlinear conjugate gradient methods to obtain the better results of image restoration with high PSNR.
On new methods of asymptotic formulas determination in waves diffraction problems
A new approach to the determination of asymptotic formulas is demonstrated by solving the problem on shear plane wave diffraction in elastic plane at semi-infinite crack edge. As opposed to the well-known traditional methods, the solving of problems like these is deducted to Riemann-type boundary problem for real axis. In order to investigate the solution obtained in the form of Fourier integrals, the sections are drawn across the coordinate axis in complex plane and as a result the problem solution is represented in form of regular integrals in sections. The asymptotic formulas are determined by the integration by parts of integrals representing wave field in contrast to the steepest descend method
Asymptotically Optimal Algorithm for Short-Term Trading Based on the Method of Calibration
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.
Solution of the Falkner-Skan wedge flow by a revised optimal homotopy asymptotic method.
Madaki, A G; Abdulhameed, M; Ali, M; Roslan, R
2016-01-01
In this paper, a revised optimal homotopy asymptotic method (OHAM) is applied to derive an explicit analytical solution of the Falkner-Skan wedge flow problem. The comparisons between the present study with the numerical solutions using (fourth order Runge-Kutta) scheme and with analytical solution using HPM-Padé of order [4/4] and order [13/13] show that the revised form of OHAM is an extremely effective analytical technique. PMID:27186477
The rate of convergence of some asymptotically chi-square distributed statistics by Stein's method
Gaunt, Robert E.; Reinert, Gesine
2016-01-01
We build on recent works on Stein's method for functions of multivariate normal random variables to derive bounds for the rate of convergence of some asymptotically chi-square distributed statistics. We obtain some general bounds and establish some simple sufficient conditions for convergence rates of order $n^{-1}$ for smooth test functions. These general bounds are applied to Friedman's statistic for comparing $r$ treatments across $n$ trials and the family of power divergence statistics fo...
Iterated preconditioned LSQR method for inverse problems on unstructured grids
This article presents a method for solving large-scale linear inverse imaging problems regularized with a nonlinear, edge-preserving penalty term such as total variation or the Perona–Malik technique. Our method is aimed at problems defined on unstructured meshes, where such regularizers naturally arise in unfactorized form as a stiffness matrix of an anisotropic diffusion operator and factorization is prohibitively expensive. In the proposed scheme, the nonlinearity is handled with lagged diffusivity fixed point iteration, which involves solving a large-scale linear least squares problem in each iteration. Because the convergence of Krylov methods for problems with discontinuities is notoriously slow, we propose to accelerate it by means of priorconditioning (Bayesian preconditioning). priorconditioning is a technique that, through transformation to the standard form, embeds the information contained in the prior (Bayesian interpretation of a regularizer) directly into the forward operator and thence into the solution space. We derive a factorization-free preconditioned LSQR algorithm (MLSQR), allowing implicit application of the preconditioner through efficient schemes such as multigrid. The resulting method is also matrix-free i.e. the forward map can be defined through its action on a vector. We illustrate the performance of the method on two numerical examples. Simple 1D-deblurring problem serves to visualize the discussion throughout the paper. The effectiveness of the proposed numerical scheme is demonstrated on a three-dimensional problem in fluorescence diffuse optical tomography with total variation regularization derived algebraic multigrid preconditioner, which is the type of large scale, unstructured mesh problem, requiring matrix-free and factorization-free approaches that motivated the work here. (paper)
An efficient iterative method for the generalized Stokes problem
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.
Iterative Methods for Scalable Uncertainty Quantification in Complex Networks
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.
PET iterative reconstruction incorporating an efficient positron range correction method.
Bertolli, Ottavia; Eleftheriou, Afroditi; Cecchetti, Matteo; Camarlinghi, Niccolò; Belcari, Nicola; Tsoumpas, Charalampos
2016-02-01
Positron range is one of the main physical effects limiting the spatial resolution of positron emission tomography (PET) images. If positrons travel inside a magnetic field, for instance inside a nuclear magnetic resonance (MR) tomograph, the mean range will be smaller but still significant. In this investigation we examined a method to correct for the positron range effect in iterative image reconstruction by including tissue-specific kernels in the forward projection operation. The correction method was implemented within STIR library (Software for Tomographic Image Reconstruction). In order to obtain the positron annihilation distribution of various radioactive isotopes in water and lung tissue, simulations were performed with the Monte Carlo package GATE [Jan et al. 2004 [1
Direct Determination of Asymptotic Structural Postbuckling Behaviour by the finite element method
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...... 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...
Direct determination of asymptotic structural postbuckling behaviour by the finite element method
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...
Krylov iterative methods and synthetic acceleration for transport in binary statistical media
In particle transport applications there are numerous physical constructs in which heterogeneities are randomly distributed. The quantity of interest in these problems is the ensemble average of the flux, or the average of the flux over all possible material 'realizations.' The Levermore-Pomraning closure assumes Markovian mixing statistics and allows a closed, coupled system of equations to be written for the ensemble averages of the flux in each material. Generally, binary statistical mixtures are considered in which there are two (homogeneous) materials and corresponding coupled equations. The solution process is iterative, but convergence may be slow as either or both materials approach the diffusion and/or atomic mix limits. A three-part acceleration scheme is devised to expedite convergence, particularly in the atomic mix-diffusion limit where computation is extremely slow. The iteration is first divided into a series of 'inner' material and source iterations to attenuate the diffusion and atomic mix error modes separately. Secondly, atomic mix synthetic acceleration is applied to the inner material iteration and S2 synthetic acceleration to the inner source iterations to offset the cost of doing several inner iterations per outer iteration. Finally, a Krylov iterative solver is wrapped around each iteration, inner and outer, to further expedite convergence. A spectral analysis is conducted and iteration counts and computing cost for the new two-step scheme are compared against those for a simple one-step iteration, to which a Krylov iterative method can also be applied.
Asymptotic-Preserving Particle-In-Cell method for the Vlasov-Poisson system near quasineutrality
Degond, Pierre; Deluzet, Fabrice; Navoret, Laurent; Sun, An-Bang; Vignal, Marie-Hélène
2009-01-01
This paper deals with the numerical resolution of the Vlasov-Poisson system in a nearly quasineutral regime by Particle-In-Cell (PIC) methods. In this regime, classical PIC methods are subject to stability constraints on the time and space steps related to the small Debye length and large plasma frequency. Here, we propose an ``Asymptotic-Preserving" PIC scheme which is not subject to these limitations. Additionally, when the plasma period and Debye length are small compared to the time and s...
On the solution of two-dimensional coupled Burgers' equations by variational iteration method
By means of variational iteration method the solutions of two-dimensional Burgers' and inhomogeneous coupled Burgers' equations are exactly obtained, comparison with the Adomian decomposition method is made, showing that the former is more effective than the later. In this paper, He's variational iteration method is given approximate solutions that can converge to its exact solutions faster than those of Adomain's method.
The Renormalization-Group Method Applied to Asymptotic Analysis of Vector Fields
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.
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.
Loli Piccolomini, Elena; Zama, Fabiana
2009-01-01
Ill posed problems constitute the mathematical model of a large variety of applications. Aim of this paper is to define an iterative algorithm finding the solution of a regularization problem. The method minimizes a function constituted by a least squares term and a generally nonlinear regularization term, weighted by a regularization parameter. The proposed method computes a sequence of iterates approximating the regularization parameter and a sequence of iterates appro...
The A-Forest Iteration Method for the Stochastic Generalized Transportation Problem
Qi, L.
1984-01-01
The stochastic generalized transportation problem (SGTP) has an optimal solution: each of the connected subgraphs of its graph is either a tree or a one-loop tree. We call such a graph an A-forest. We propose here a finitely convergent method, the A-forest iteration method, to solve the SGTP. It iterates from one base A-forest triple to another base A-Forest triple. The iteration techniques constitute some modifications of those for the first iteration method for solving the stochastic transp...
Iterative Method and Dithering with Averaging used for Correction of ADC Error
Kamenský, M.; Kováč, K.
2009-01-01
Additive iterative method in combination with averaging of dithered samples is designed for self-correction of ADC linearity error in the paper. Iterative method is one of the automated error correction techniques. Dithering is a special tool for quantizer performance enhancement. Dither theory for Gaussian noise and averaging has been used for exhibition of method abilities in ADC characteristic improvement.
Analysis of transverse shear strains in pre-twisted thick beams using variational asymptotic method
Ameen, Maqsood M.; Harursampath, Dineshkumar, E-mail: m.ameen@tue.nl, E-mail: dinesh@aero.iisc.ernet.in [Department of Aerospace Engineering, Indian Institute of Science, Bangalore-560012 (India)
2015-03-10
The cross-sectional stiffness matrix is derived for a pre-twisted, moderately thick beam made of transversely isotropic materials and having rectangular cross sections. An asymptotically-exact methodology is used to model the anisotropic beam from 3-D elasticity, without any further assumptions. The beam is allowed to have large displacements and rotations, but small strain is assumed. The strain energy is computed making use of the beam constitutive law and kinematical relations derived with the inclusion of geometrical nonlinearities and an initial twist. The energy functional is minimized making use of the Variational Asymptotic Method (VAM), thereby reducing the cross section to a point on the beam reference line with appropriate properties, forming a 1-D constitutive law. VAM is a mathematical technique employed in the current problem to rigorously split the 3-D analysis of beams into two: a 2-D analysis over the beam cross-sectional domain, which provides a compact semi-analytical form of the properties of the cross sections, and a nonlinear 1-D analysis of the beam ref-erence curve. In this method, as applied herein, the cross-sectional analysis is performed asymptotically by taking advantage of a material small parameter and two geometric small parameters. 3-D strain components are derived using kinematics and arranged in orders of the small parameters. Closed-form expressions are derived for the 3-D non-linear warping and stress fields. Warping functions are obtained by the minimization of strain energy subject to certain set of constraints that render the 1-D strain measures well-defined. The zeroth-order 3-D warping field thus yielded is then used to integrate the 3-D strain energy density over the cross section, resulting in the 1-D strain energy density, which in turn helps identify the corresponding cross-sectional stiffness matrix. The model is capable of predicting interlaminar and transverse shear stresses accurately up to first order.
Analysis of transverse shear strains in pre-twisted thick beams using variational asymptotic method
The cross-sectional stiffness matrix is derived for a pre-twisted, moderately thick beam made of transversely isotropic materials and having rectangular cross sections. An asymptotically-exact methodology is used to model the anisotropic beam from 3-D elasticity, without any further assumptions. The beam is allowed to have large displacements and rotations, but small strain is assumed. The strain energy is computed making use of the beam constitutive law and kinematical relations derived with the inclusion of geometrical nonlinearities and an initial twist. The energy functional is minimized making use of the Variational Asymptotic Method (VAM), thereby reducing the cross section to a point on the beam reference line with appropriate properties, forming a 1-D constitutive law. VAM is a mathematical technique employed in the current problem to rigorously split the 3-D analysis of beams into two: a 2-D analysis over the beam cross-sectional domain, which provides a compact semi-analytical form of the properties of the cross sections, and a nonlinear 1-D analysis of the beam ref-erence curve. In this method, as applied herein, the cross-sectional analysis is performed asymptotically by taking advantage of a material small parameter and two geometric small parameters. 3-D strain components are derived using kinematics and arranged in orders of the small parameters. Closed-form expressions are derived for the 3-D non-linear warping and stress fields. Warping functions are obtained by the minimization of strain energy subject to certain set of constraints that render the 1-D strain measures well-defined. The zeroth-order 3-D warping field thus yielded is then used to integrate the 3-D strain energy density over the cross section, resulting in the 1-D strain energy density, which in turn helps identify the corresponding cross-sectional stiffness matrix. The model is capable of predicting interlaminar and transverse shear stresses accurately up to first order
曾六川
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.
Iterative methods for symmetric ill-conditioned Toeplitz matrices
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.
Towards advanced welding methods for the ITER vacuum vessel sectors
The problem of joining the International Thermonuclear Experimental Reactor (ITER) vacuum vessel (VV) sectors, considering the tolerance requirements of the blanket attachments, and the time required for TIG welding, continues to stimulate EU R and D into power beam welding techniques which can yield fewer passes, less welding time and lower distortion. The previous work on reduced pressure e-beam welding showed that penetration varied with position, fit-up, distance and pressure and single-pass weld control was deemed to be not reliable enough so the work direction changed to an all-e-beam welding procedure where the root weld is carried out with rest-current-control and the fill passes by wire-fill. In addition, a novel method of increasing the possible single-pass weld thickness for overhead positions is investigated demonstrated and now patented. Another solution may be offered with wire-fill NdYAG laser welding, which has demonstrated useable and stable results and proved improved performance over TIG. Preliminary work has shown even further advantages with the introduction of hybrid MIG/Laser welding
A New General Iterative Method for a Finite Family of Nonexpansive Mappings in Hilbert Spaces
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.
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.
Research on the iterative method for model updating based on the frequency response function
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.
Evaluation of Continuation Desire as an Iterative Game Development Method
Schoenau-Fog, Henrik; Birke, Alexander; Reng, Lars
2012-01-01
When developing a game it is always valuable to use feedback from players in each iteration, in order to plan the design of the next iteration. However, it can be challenging to devise a simple approach to acquiring information about a player's engagement while playing. In this paper we will thus...... concerning a crowd game which is controlled by smartphones and is intended to be played by audiences in cinemas and at venues with large screens. The case study demonstrates how the approach can be used to help improve the desire to continue when developing a game....
Comparison of advanced iterative reconstruction methods for SPECT/CT
Aim: Corrective image reconstruction methods which produce reconstructed images with improved spatial resolution and decreased noise level became recently commercially available. In this work, we tested the performance of three new software packages with reconstruction schemes recommended by the manufacturers using physical phantoms simulating realistic clinical settings. Methods: A specially designed resolution phantom containing three 99mTc lines sources and the NEMA NU-2 image quality phantom were acquired on three different SPECT/CT systems (General Electrics Infinia, Philips BrightView and Siemens Symbia T6). Measurement of both phantoms was done with the trunk filled with a 99mTc-water solution. The projection data were reconstructed using the GE's Evolution for Bone registered, Philips Astonish registered and Siemens Flash3D registered software. The reconstruction parameters employed (number of iterations and subsets, the choice of post-filtering) followed theses recommendations of each vendor. These results were compared with reference reconstructions using the ordered subset expectation maximization (OSEM) reconstruction scheme. Results: The best results (smallest value for resolution, highest percent contrast values) for all three packages were found for the scatter corrected data without applying any post-filtering. The advanced reconstruction methods improve the full width at half maximum (FWHM) of the line sources from 11.4 to 9.5 mm (GE), from 9.1 to 6.4 mm (Philips), and from 12.1 to 8.9 mm (Siemens) if no additional post filter was applied. The total image quality control index measured for a concentration ratio of 8:1 improves for GE from 147 to 189, from 179. to 325 for Philips and from 217 to 320 for Siemens using the reference method for comparison. The same trends can be observed for the 4:1 concentration ratio. The use of a post-filter reduces the background variability approximately by a factor of two, but deteriorates significantly the
An Asymptotic-Preserving Method for a Relaxation of the Navier-Stokes-Korteweg Equations
Chertock, Alina; Neusser, Jochen
2015-01-01
The Navier-Stokes-Korteweg (NSK) equations are a classical diffuse-interface model for compressible two-phase flow. As direct numerical simulations based on the NSK system are quite expensive and in some cases even impossible, we consider a relaxation of the NSK system, for which robust numerical methods can be designed. However, time steps for explicit numerical schemes depend on the relaxation parameter and therefore numerical simulations in the relaxation limit are very inefficient. To overcome this restriction, we propose an implicit-explicit asymptotic-preserving finite volume method. We prove that the new scheme provides a consistent discretization of the NSK system in the relaxation limit and demonstrate that it is capable of accurately and efficiently computing numerical solutions of problems with realistic density ratios and small interfacial widths.
Monitoring 3D dose distributions in proton therapy by reconstruction using an iterative method.
Kim, Young-Hak; Yoon, Changyeon; Lee, Wonho
2016-08-01
The Bragg peak of protons can be determined by measuring prompt γ-rays. In this study, prompt γ-rays detected by single-photon emission computed tomography with a geometrically optimized collimation system were reconstructed by an iterative method. The falloff position by iterative method (52.48mm) was most similar to the Bragg peak (52mm) of an 80MeV proton compared with those of back-projection (54.11mm) and filtered back-projection (54.91mm) methods. Iterative method also showed better image performance than other methods. PMID:27179145
On the Convergence for an Iterative Method for Quasivariational Inclusions
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.
Application of optimal homotopy asymptotic method to nonlinear Bingham fluid dampers
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...
International Conference on Boundary and Interior Layers : Computational and Asymptotic Methods
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...
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.
Non-iterative and exact method for constraining particles in a linear geometry
Tapia-McClung, Horacio; Grønbech-Jensen, Niels
2004-01-01
We present a practical numerical method for evaluating the Lagrange multipliers necessary for maintaining a constrained linear geometry of particles in dynamical simulations. The method involves no iterations, and is limited in accuracy only by the numerical methods for solving small systems of linear equations. As a result of the non-iterative and exact (within numerical accuracy) nature of the procedure there is no drift in the constrained geometry, and the method is therefore readily appli...
Kalaida, A.F. [Kiev Univ. (Ukraine)
1994-11-10
We construct and analyze for convergence a quadrature-iteration method for Volterra integral equations of the second kind and a quadrature-splitting method for linear equations. The iteration processes producing an approximate solution are accelerated, because the integral operator is approximated by a quadrature operator with an arbitrarily small residual operator.
On Two Iterative Methods for Mixed Monotone Variational Inequalities
Xiwen Lu
2010-01-01
Full Text Available A mixed monotone variational inequality (MMVI problem in a Hilbert space H is formulated to find a point u∗∈H such that 〈Tu∗,v−u∗〉+φ(v−φ(u∗≥0 for all v∈H, where T is a monotone operator and φ is a proper, convex, and lower semicontinuous function on H. Iterative algorithms are usually applied to find a solution of an MMVI problem. We show that the iterative algorithm introduced in the work of Wang et al., (2001 has in general weak convergence in an infinite-dimensional space, and the algorithm introduced in the paper of Noor (2001 fails in general to converge to a solution.
Fourier analysis of multigrid-type iterative methods
Experiments indicate that a multigrid-type cycle can be used as an efficient preconditioner in the iterative solution of the discrete problem corresponding to a singularly perturbed elliptic boundary-value problem. Motivated by a report of Goldstein, the author explores the theoretical basis for the efficiency of such a preconditioner when applied to a model problem. The techniques developed are also used to analyze a multigrid V-cycle when used alone as a fast iterative solver. The solution of the one-dimensional indefinite Helmholtz problem using standard multigrid V-cycles is considered. By analyzing various choices of projection, interpolation, smoothers, and coarse-grid operators, a particular combination is found that preserves typical multigrid efficiency even in this indefinite case
ITERATIVE MULTICHANNEL BLIND DECONVOLUTION METHOD FOR TEMPORALLY COLORED SOURCES
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.
An Iteration Method for Nonexpansive Mappings in Hilbert Spaces
Wang Lin
2006-01-01
In real Hilbert space , from an arbitrary initial point , an explicit iteration scheme is defined as follows: , where , is a nonexpansive mapping such that is nonempty, is a -strongly monotone and -Lipschitzian mapping, , and . Under some suitable conditions, the sequence is shown to converge strongly to a fixed point of and the necessary and sufficient conditions that converges strongly to a fixed point of are obtained.
Drawing Dynamical and Parameters Planes of Iterative Families and Methods
Chicharro, Francisco I.
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). PMID:24376386
Dynamic RCS Simulation of a Missile Target Group Based on the High-frequency Asymptotic Method
Zhao Tao
2014-04-01
Full Text Available To simulate dynamic Radar Cross Section (RCS of missile target group, an efficient RCS prediction approach is proposed based on the high-frequency asymptotic theory. The minimal energy trajectory and coordinate transformation is used to get trajectories of the missile, decoys and roll booster, and establish the dynamic scene for the separate procedure of the target group, and the dynamic RCS including specular reflection, edge diffraction and multi-reflection from the target group are obtained by Physical Optics (PO, Equivalent Edge Currents (EEC and Shooting-and-Bouncing Ray (SBR methods. Compared with the dynamic RCS result with the common interpolation method, the proposed method is consistent with the common method when the targets in the scene are far away from each other and each target is not sheltered by others in the incident direction. When the target group is densely distributed and the shelter effect can not be neglected, the interpolation method is extremely difficult to realize, whereas the proposed method is successful.
A matrix non-iterative method to calculate the periodical distribution in reactors with thermal regeneration is presented. In case of exothermic reaction, a source term will be included. A computer code was developed to calculate the final temperature distribution in solids and in the outlet temperatures of the gases. The results obtained from ethane oxidation calculation in air, using the Dietrich kinetic data are presented. This method is more advantageous than iterative methods. (E.G.)
Mullen, Marie
2010-01-01
The main focus of this work is to contribute to the development of iterative solvers applied to the method of moments solution of electromagnetic wave scattering problems. In recent years there has been much focus on current marching iterative methods, such as Gauss-Seidel and others. These methods attempt to march a solution for the unknown basis function amplitudes in a manner that mimics the physical processes which create the current. In particular the forward backwar...
Asymptotics and Borel summability
Costin, Ovidiu
2008-01-01
Incorporating substantial developments from the last thirty years into one resource, Asymptotics and Borel Summability provides a self-contained introduction to asymptotic analysis with special emphasis on topics not covered in traditional asymptotics books. The author explains basic ideas, concepts, and methods of generalized Borel summability, transseries, and exponential asymptotics. He provides complete mathematical rigor while supplementing it with heuristic material and examples, so that some proofs may be omitted by applications-oriented readers.To give a sense of how new methods are us
An iterative method for robust in-line phase contrast imaging
Carroll, Aidan J.; van Riessen, Grant A.; Balaur, Eugeniu; Dolbnya, Igor P.; Tran, Giang N.; Peele, Andrew G.
2016-04-01
We present an iterative near-field in-line phase contrast method that allows quantitative determination of the thickness of an object given the refractive index of the sample material. The iterative method allows for quantitative phase contrast imaging in regimes where the contrast transfer function (CTF) and transport of intensity equation (TIE) cannot be applied. Further, the nature of the iterative scheme offers more flexibility and potentially allows more high-resolution image reconstructions when compared to TIE method and less artefacts when compared to the CTF method. While, not addressed here, extension of our approach in future work to broadband illumination will also be straightforward as the wavelength dependence of the refractive index of an object can be readily incorporated into the iterative approach.
SOLUTION OF THE TWO-PHASE STEFAN PROBLEM BY USING THE PICARD'S ITERATIVE METHOD
Roman Witula; Edyta Hetmaniok; Damian Slota; Adam Zielonka
2011-01-01
In this paper, an application of the Picard's iterative method for finding the solution of two phase Stefan problem is presented. In the proposed method an iterative connection is formulated, which allows to determine the temperature distribution in considered domain. Another unknown function, describing position of the moving interface, is approximated with the aid of linear combination of some base functions. Coefficients of this combination are determined by minimizing a properly construct...
Inexact Krylov iterations and relaxation strategies with fast-multipole boundary element method
Layton, Simon K.; Barba, Lorena A.
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$. ...
Hanfeng Kuang; Jinbo Liu; Xi Chen; Jie Mao; Linjie He
2013-01-01
The asymptotic behavior of a class of switched stochastic cellular neural networks (CNNs) with mixed delays (discrete time-varying delays and distributed time-varying delays) is investigated in this paper. Employing the average dwell time approach (ADT), stochastic analysis technology, and linear matrix inequalities technique (LMI), some novel sufficient conditions on the issue of asymptotic behavior (the mean-square ultimate boundedness, the existence of an attractor, and the mean-square ...
Exact asymptotics of probabilities of large deviations for Markov chains: the Laplace method
We prove results on exact asymptotics as n→∞ for the expectations Ea exp{-θΣk=0n-1g(Xk)} and probabilities Pa{(1/n Σk=0n-1g(Xk)k}k=1∞ is a sequence of independent identically Laplace-distributed random variables, Xn=X0+Σk=1nξk, n≥1, is the corresponding random walk on R, g(x) is a positive continuous function satisfying certain conditions, and d>0, θ>0, a element of R are fixed numbers. Our results are obtained using a new method which is developed in this paper: the Laplace method for the occupation time of discrete-time Markov chains. For g(x) one can take |x|p, log (|x|p+1), p>0, |x| log (|x|+1), or eα|x|-1, 0<α<1/2, x element of R, for example. We give a detailed treatment of the case when g(x)=|x| using Bessel functions to make explicit calculations.
Benvenuto, F.; La Camera, A.; Theys, C.; Ferrari, A.; Lantéri, H.; Bertero, M.
2008-06-01
In 1993, Snyder et al investigated the maximum-likelihood (ML) approach to the deconvolution of images acquired by a charge-coupled-device camera and proved that the iterative method proposed by Llacer and Nuñez in 1990 can be derived from the expectation-maximization method of Dempster et al for the solution of ML problems. The utility of the approach was shown on the reconstruction of images of the Hubble space Telescope. This problem deserves further investigation because it can be important in the deconvolution of images of faint objects provided by next-generation ground-based telescopes that will be characterized by large collecting areas and advanced adaptive optics. In this paper, we first prove the existence of solutions of the ML problem by investigating the properties of the negative log of the likelihood function. Next, we show that the iterative method proposed by the above-mentioned authors is a scaled gradient method for the constrained minimization of this function in the closed and convex cone of the non-negative vectors and that, if it is convergent, the limit is a solution of the constrained ML problem. Moreover, by looking for the asymptotic behavior in the regime of high numbers of photons, we find an approximation that, as proved by numerical experiments, works well for any number of photons, thus providing an efficient implementation of the algorithm. In the case of image deconvolution, we also extend the method to take into account boundary effects and multiple images of the same object. The approximation proposed in this paper is tested on a few numerical examples.
A fast iterative method to compute the flow around a submerged body
Malmliden, J.F.; Petersson, N.A.
1996-07-01
The authors develop an efficient iterative method for computing steady linearized potential flow around a submerged body moving in a liquid of finite constant depth. In this paper they restrict the presentation to the two-dimensional problem, but the method is readily generalizable to the three-dimensional case, i.e., the flow in a canal. The problem is indefinite, which makes the convergence of most iterative methods unstable. To circumvent this difficulty, the authors decompose the problem into two more easily solvable subproblems and form a Schwarz-type iteration to solve the original problem. The first subproblem is definite and can therefore be solved by standard iterative methods. The second subproblem is indefinite but has no body. It is therefore easily and efficiently solvable by separation of variables. The authors prove that the iteration converges for sufficiently small Froude numbers. In addition, they present numerical results for a second-order accurate discretization of the problem. They demonstrate that the iterative method converges rapidly, and that the convergences rate improves when the Froude number decreases. They also verify numerically that the convergence rate is essentially independent of the grid size. 20 refs., 6 figs., 10 tabs.
Iterative methods for distributed parameter estimation in parabolic PDE
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.
Evaluating user reputation in online rating systems via an iterative group-based ranking method
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...
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.
Application of SSOR-PCG method with improved iteration format in FEM simulation of massive concrete
Lin HAN
2011-09-01
Full Text Available In this study, for the purpose of improving the efficiency and accuracy of numerical simulation of massive concrete, the symmetric successive over relaxation-preconditioned conjugate gradient method (SSOR-PCGM with an improved iteration format was derived and applied to solution of large sparse symmetric positive definite linear equations in the computational process of the finite element analysis. A three-dimensional simulation program for massive concrete was developed based on SSOR-PCGM with an improved iteration format. Then, the programs based on the direct method and SSOR-PCGM with an improved iteration format were used for computation of the Guandi roller compacted concrete (RCC gravity dam and an elastic cube under free expansion. The comparison and analysis of the computational results show that SSOR-PCGM with the improved iteration format occupies much less physical memory and can solve larger-scale problems with much less computing time and flexible control of accuracy.
Intelligent Iterated Local Search Methods for Solving Vehicle Routing Problem with Different Fleets
无
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.
Analysis of Diffusion Problems using Homotopy Perturbation and Variational Iteration Methods
Barari, Amin; Poor, A. Tahmasebi; Jorjani, A.; Mirgolbabaei, H.
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 to...... solve the diffusion equations herein have been applied to a variety of problems in the recent past, and have proved to yield highly accurate solutions. Comparison is made between the exact solutions and the results of the variational iteration method (VIM) and homotopy perturbation method (HPM) in order...... to verify the accuracy of the results, revealing the fact that these methods are very effective and simple....
CONVERGENCE OF PARALLEL DIAGONAL ITERATION OF RUNGE-KUTTA METHODS FOR DELAY DIFFERENTIAL EQUATIONS
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.
A Direct Iteration Method using Resonance Integral Table for the Self-Shielding Calculations
In this paper, a direct iteration method using the resonance integral table is introduced for the self-shielding calculations. The basic purpose of this paper is to show the possibility that the HELIOS subgroup method can be replaced with this method. This method doesn't use the subgroup data but only the resonance integral tables given in library. The basic idea of this method is to use the Bondarenko's iteration in order to obtain the self-shielded effective cross sections with the background cross sections which are calculated by the heterogeneous transport calculation. This method is implemented in the KARMA lattice calculation code and tested
A Direct Iteration Method using Resonance Integral Table for the Self-Shielding Calculations
Hong, Ser Gi; Kim, Kang Seog; Song, Jae Seung [Korea Atomic Energy Research Institute, Daejeon (Korea, Republic of)
2009-10-15
In this paper, a direct iteration method using the resonance integral table is introduced for the self-shielding calculations. The basic purpose of this paper is to show the possibility that the HELIOS subgroup method can be replaced with this method. This method doesn't use the subgroup data but only the resonance integral tables given in library. The basic idea of this method is to use the Bondarenko's iteration in order to obtain the self-shielded effective cross sections with the background cross sections which are calculated by the heterogeneous transport calculation. This method is implemented in the KARMA lattice calculation code and tested.
Zhu Hanqing; Wu Zhengde; K. M. Luk
2003-01-01
In this paper, an absorbing Fictitious Boundary Condition (FBC) is presented to generate an iterative Domain Decomposition Method (DDM) for analyzing waveguide problems.The relaxed algorithm is introduced to improve the iterative convergence. And the matrix equations are solved using the multifrontal algorithm. The resulting CPU time is greatly reduced.Finally, a number of numerical examples are given to illustrate its accuracy and efficiency.
Iterative and FEM methods to solve the 2-D Radiative Transfer Equation with specular reflexion
Le Hardy, David; Favennec, Yann; Rousseau, Benoît
2016-01-01
The present paper deals with iterative algorithms coupled with finite element methods (FEM) to solve the Radiative Transfer Equation (RTE) within semi-transparent heterogenous materials where specular reflexions occur on their boundaries. As our intention is to use such solution for inversion, the forward model should be solved as fastly as possible. This communication compares, in terms of both accuracy and CPU, the Discontinuous Galerkin (DG) method with the Streamline Upwind Petrov-Galerkin (SUPG) method, both being coupled with the Discrete Ordinate Method. Next, several iteratives methods used to accelerate the convergence are compared. These methods are the Gauss-Siedel (GS), the Source-Iteration (SI) and the Successive Over-Relaxation (SOR) methods.
This study is concerned with the transverse axial gamma emission tomography. The problem of self-attenuation of radiations in biologic tissues is raised. The regularizing iterative method is developed, as a reconstruction method of 3 dimensional images. The different steps from acquisition to results, necessary to its application, are described. Organigrams relative to each step are explained. Comparison notion between two reconstruction methods is introduced. Some methods used for the comparison or to bring about the characteristics of a reconstruction technique are defined. The studies realized to test the regularizing iterative method are presented and results are analyzed
STRONG CONVERGENCE OF MONOTONE HYBRID METHOD FOR FIXED POINT ITERATION PROCESSES
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.
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.
Improving Convergence of Iterative Feedback Tuning using Optimal External Perturbations
Huusom, Jakob Kjøbsted; Hjalmarsson, Håkon; Poulsen, Niels Kjølstad; Jørgensen, Sten Bay
Iterative feedback tuning constitutes an attractive control loop tuning method for processes in the absence of sufficient process insight. It is a purely data driven approach to optimization of the loop performance. The standard formulation ensures an unbiased estimate of the loop performance cost...... introducing an optimal perturbation signal in the tuning algorithm. For minimum variance control design the optimal design of an external perturbation signal is derived in terms of the asymptotic accuracy of the iterative feedback tuning method....
Frequency-space domain acoustic wave simulation with the BiCGstab (ℓ) iterative method
Du, Zengli; Liu, Jianjun; Liu, Wenge; Li, Chunhong
2016-02-01
The vast computational cost and memory requirements of LU decomposition are major obstacles to 3D seismic modelling in the frequency-space domain. BiCGstab (ℓ) is an effective bi-conjugate gradient method to solve the giant sparse linear equations, but the convergence rate is extremely low when the threshold value is set small enough. The BiCGstab (ℓ) iterative method was introduced into 3D numerical simulation to overcome these problems in this paper. Numerical examples have shown that the precision of the BiCGstab (ℓ) iterative method meets the demand of seismic modelling and the result is equivalent to that of LU decomposition. The computational cost and memory resource demands of the BiCGstab (ℓ) iterative method are superior to that of LU decomposition. It is an effective method of 3D seismic modelling in the frequency-space domain.
Dilts, James
2014-01-01
We prove that in a certain class of conformal data on an asymptotically cylindrical manifold, if the conformally decomposed Einstein constraint equations do not admit a solution, then one can always find a nontrivial solution to the limit equation first explored by Dahl, Gicquaud, and Humbert in [DGH11]. We also give an example of a Ricci curvature condition on the manifold which precludes the existence of a solution to this limit equation, showing that such a limit criterion can be a useful tool for studying the Einstein constraint equations on manifolds with asymptotically cylindrical ends.
In this paper we consider the iteratively regularized Gauss–Newton method for solving nonlinear ill-posed inverse problems. Under merely the Lipschitz condition, we prove that this method together with an a posteriori stopping rule defines an order optimal regularization method if the solution is regular in some suitable sense
A Comparison of Iterative 2D-3D Pose Estimation Methods for Real-Time Applications
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...
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.
Precise knowledge of cold-atom collision properties is essential for the studies of Bose-Einstein condensation or cold molecule formation. In such experiments, the interaction mainly occurs at rather large interatomic distance, in the so-called asymptotic region. We have developed a purely asymptotic method which allows us to fully describe the collision properties of cold alkali atoms without using the inner part of the molecular potentials, which is often known with a poor precision. The key point of the method is the setting of nodal lines, which are the lines connecting the nodes of successive radial wavefunctions near the ground state threshold. Within the framework of Born-Oppenheimer approximation, computing such nodal lines, by numerical integration of the radial Schroedinger equation in the asymptotic region only, provides a very simple way to derive scattering lengths from observed bound level positions. The method has been extended to the multichannel case and appears now as a genuine parametric method, in which a few parameters (some chosen nodal lines) replace the inner part of the potentials. These nodal lines are used as fitting parameters, which are adjusted on experimental results. Once these parameters have been determined, any collision property such as scattering lengths, clock shifts or magnetic field induced Feshbach resonances can be deduced in principle. This method has been applied to obtain the collision properties of ultracold sodium and cesium atoms. (author)
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.
Hong, Baojian; Lu, Dianchen
2014-01-01
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. PMID:25276865
Second degree generalized Jacobi iteration method for solving system of linear equations
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.
A CLASS OF LDPC CODE'S CONSTRUCTION BASED ON AN ITERATIVE RANDOM METHOD
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.
Accumulated approximation: A new method for structural optimization by iterative improvement
Rasmussen, John
1990-01-01
A new method for the solution of non-linear mathematical programming problems in the field of structural optimization is presented. It is an iterative scheme which for each iteration refines the approximation of objective and constraint functions by accumulating the function values of previously visited design points. The method has proven to be competitive for a number of well-known examples of which one is presented here. Furthermore because of the accumulation strategy, the method produces convergence even when the sensitivity analysis is inaccurate.
Asymptotic-preserving Particle-In-Cell methods for the Vlasov-Maxwell system near quasi-neutrality
Degond, Pierre; Doyen, David
2015-01-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 we...
The use of He's variational iteration method for solving a Fokker-Planck equation
This paper applies the variational iteration method to an initial value problem of parabolic type. This method is based on the use of Lagrange multipliers for identification of optimal values of parameters in a functional. This method is a powerful tool for solving various kinds of problems. Employing this technique, it is possible to find the exact solution or an approximate solution of the problem. Using the variational iteration method of He, a rapid convergent sequence is produced which tends to the exact solution of the problem. The results of this method are the same as with the results obtained by the Adomian decomposition method. The fact that this technique solves nonlinear equations without using Adomian polynomials can be considered as an advantage of this method over the Adomian decomposition procedure. The linear and nonlinear cases of the Fokker-Planck equation are considered and solved using the variational iteration method. To show the efficiency of the variational iteration method, several examples are presented
Bousquet-Mélou, Mireille; Soria, Michèle
2014-01-01
The present volume collects the proceedings of Aofa’14, the 25th International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods for the Analysis of Algorithms held at Université Pierre et Marie Curie, Paris, France, during June 16-20, 2014. The conference builds on the communities of the former series of conferences “Mathematics and Computer Science” and “Analysis of Algorithms”, and aims at studying rigorously the combinatorial objects which appear in the analysis of data stru...
Iterative acceleration methods for Monte Carlo and deterministic criticality calculations
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
Iterative acceleration methods for Monte Carlo and deterministic criticality calculations
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.
Highly Nonlinear Temperature-Dependent Fin Analysis by Variational Iteration Method
Fouladi, F.; Hosseinzadeh, E.; Barari, Amin;
2010-01-01
In this research, the variational iteration method as an approximate analytical method is utilized to overcome some inherent limitations arising as uncontrollability to the nonzero endpoint boundary conditions and is used to solve some examples in the field of heat transfer. The available exact s...
Modified variational iteration method for an El Ni(n)o Southern Oscillation delayed oscillator
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.
DIRECT ITERATIVE METHODS FOR RANK DEFICIENT GENERALIZED LEAST SQUARES PROBLEMS
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.
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.
Iterative Methods for the Force-based Quasicontinuum Approximation
Dobson, Matthew; Luskin, Mitchell; Ortner, Christoph
2009-01-01
Force-based atomistic-continuum hybrid methods are the only known pointwise consistent methods for coupling a general atomistic model to a finite element continuum model. For this reason, and due to their algorithmic simplicity, force-based coupling methods have become a popular class of atomistic-continuum hybrid models as well as other types of multiphysics models. However, the recently discovered unusual stability properties of the linearized force-based quasicontinuum (QCF) approximation,...
Three-Step Iterative Methods with Sixth-Order Convergence for Solving Nonlinear Equations
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.
Chatter suppression methods of a robot machine for ITER vacuum vessel assembly and maintenance
Highlights: •A redundant 10-DOF serial-parallel hybrid robot for ITER assembly and maintains is presented. •A dynamic model of the robot is developed. •A feedback and feedforward controller is presented to suppress machining vibration of the robot. -- Abstract: In the process of assembly and maintenance of ITER vacuum vessel (ITER VV), various machining tasks including threading, milling, welding-defects cutting and flexible hose boring are required to be performed from inside of ITER VV by on-site machining tools. Robot machine is a promising option for these tasks, but great chatter (machine vibration) would happen in the machining process. The chatter vibration will deteriorate the robot accuracy and surface quality, and even cause some damages on the end-effector tools and the robot structure itself. This paper introduces two vibration control methods, one is passive and another is active vibration control. For the passive vibration control, a parallel mechanism is presented to increase the stiffness of robot machine; for the active vibration control, a hybrid control method combining feedforward controller and nonlinear feedback controller is introduced for chatter suppression. A dynamic model and its chatter vibration phenomena of a hybrid robot is demonstrated. Simulation results are given based on the proposed hybrid robot machine which is developed for the ITER VV assembly and maintenance
Chatter suppression methods of a robot machine for ITER vacuum vessel assembly and maintenance
Wu, Huapeng; Wang, Yongbo, E-mail: yongbo.wang@lut.fi; Li, Ming; Al-Saedi, Mazin; Handroos, Heikki
2014-10-15
Highlights: •A redundant 10-DOF serial-parallel hybrid robot for ITER assembly and maintains is presented. •A dynamic model of the robot is developed. •A feedback and feedforward controller is presented to suppress machining vibration of the robot. -- Abstract: In the process of assembly and maintenance of ITER vacuum vessel (ITER VV), various machining tasks including threading, milling, welding-defects cutting and flexible hose boring are required to be performed from inside of ITER VV by on-site machining tools. Robot machine is a promising option for these tasks, but great chatter (machine vibration) would happen in the machining process. The chatter vibration will deteriorate the robot accuracy and surface quality, and even cause some damages on the end-effector tools and the robot structure itself. This paper introduces two vibration control methods, one is passive and another is active vibration control. For the passive vibration control, a parallel mechanism is presented to increase the stiffness of robot machine; for the active vibration control, a hybrid control method combining feedforward controller and nonlinear feedback controller is introduced for chatter suppression. A dynamic model and its chatter vibration phenomena of a hybrid robot is demonstrated. Simulation results are given based on the proposed hybrid robot machine which is developed for the ITER VV assembly and maintenance.
Boosting iterative stochastic ensemble method for nonlinear calibration of subsurface flow models
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.
A concise iterative method using the Bezier technique for baseline construction.
Liu, Yuanjie; Zhou, Xiaoguang; Yu, Yude
2015-12-01
A novel approach, coined the Corner-Cutting method (CC, for short), is presented in this paper which affords the efficient construction of the baseline for analytical data streams. It was derived from techniques used in computer aided geometric design, a field established to produce curves and surfaces for the aviation and automobile industries. This corner-cutting technique provided a very efficient baseline calculation through an iterative process. Furthermore, a terminal condition was developed to make the process fully automated and truly non-parametric. Finally, we employed a Bezier curve to convert the iterating result into a smooth baseline solution. Compared to other iterative schemes used for baseline detection, our method was significantly efficient, easier to implement, and had a broader range of applications. PMID:26517702
The Projected GSURE for Automatic Parameter Tuning in Iterative Shrinkage Methods
Giryes, Raja; Eldar, Yonina C
2010-01-01
Linear inverse problems are very common in signal and image processing. Many algorithms that aim at solving such problems include unknown parameters that need tuning. In this work we focus on optimally selecting such parameters in iterative shrinkage methods for image deblurring and image zooming. Our work uses the projected Generalized Stein Unbiased Risk Estimator (GSURE) for determining the threshold value lambda and the iterations number K in these algorithms. The proposed parameter selection is shown to handle any degradation operator, including ill-posed and even rectangular ones. This is achieved by using GSURE on the projected expected error. We further propose an efficient greedy parameter setting scheme, that tunes the parameter while iterating without impairing the resulting deblurring performance. Finally, we provide extensive comparisons to conventional methods for parameter selection, showing the superiority of the use of the projected GSURE.
Generation of Shaped beam Radiation patterns from a Line source using Iterative sampling method
G.R.L.V.N.Srinivasa Raju
2013-08-01
Full Text Available For the generation of cosecant and trapezoidal radiation patterns an iterative sampling method is introduced by Stutzman. In this paper, an original radiation pattern which is some approximation to the desired radiation pattern is generated by a standard synthesis method and a series of correction patterns are applied to it by addinga correction pattern. This process is continued until the desired performance is achieved. In the present work, ramp, sector, cosecant, trapezoidal and stair stepped radiation patterns are generated using iterative procedure. The current distribution is found after corrections are applied. Studies are made with good number of examples, which showed that patterns with low side lobe level or low main beam ripple or sharp cut off from the main beam can be obtained. An iterative procedure is simple and converges rapidly.
The asymptotic convergence factor for a polygon under a perturbation
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}.
Iterative method of finding hydraulic conductivity characteristics of soil moisture
Rysbaiuly, Bolatbek; Adamov, Abilmazhin
2016-08-01
The work considers an initial boundary value problem for a nonlinear equation of hydraulic conductivity. A method of finding a nonlinear diffusion coefficient is developed and hydraulic conductivity of soil moisture is found. Numerical calculations are conducted.
Duality-based Asymptotic-Preserving method for highly anisotropic diffusion equations
Degond, Pierre; Deluzet, Fabrice; Lozinski, Alexei; Narski, Jacek; Negulescu, Claudia
2010-01-01
The present paper introduces an efficient and accurate numerical scheme for the solution of a highly anisotropic elliptic equation, the anisotropy direction being given by a variable vector field. This scheme is based on an asymptotic preserving reformulation of the original system, permitting an accurate resolution independently of the anisotropy strength and without the need of a mesh adapted to this anisotropy. The counterpart of this original procedure is the larger system size, enlarged ...
On the preconditioned AOR iterative method for Z-matrices
Salkuyeh, Davod Khojasteh
2011-01-01
Several preconditioned AOR methods have been proposed to solve system of linear equations $Ax=b$, where $A \\in \\mathbb{R}^{n \\times n}$ is a unit Z-matrix. The aim of this paper is to give a comparison result for a class of preconditioners $P$, where $P\\in \\mathbb{R}^{n\\times n}$ is nonsingular, nonnegative and has unit diagonal entries. Numerical results for corresponding preconditioned GMRES methods are given to illustrate the theoretical results.