نتایج جستجو برای: inner outer iteration

تعداد نتایج: 167753  

Journal: :SIAM J. Scientific Computing 1999
Gene H. Golub Qiang Ye

An important variation of preconditioned conjugate gradient algorithms is inexact precon-ditioner implemented with inner-outer iterations 5], where the preconditioner is solved by an inner iteration to a prescribed precision. In this paper, we formulate an inexact preconditioned conjugate gradient algorithm for a symmetric positive deenite system and analyze its convergence property. We establi...

Journal: :Computer Physics Communications 2005
Nigel Cundy J. van den Eshof Andreas Frommer Stefan Krieg Thomas Lippert Katrin Schäfer

The numerical and computational aspects of chiral fermions in lattice quantum chromodynamics are extremely demanding. In the overlap framework, the computation of the fermion propagator leads to a nested iteration where the matrix vector multiplications in each step of an outer iteration have to be accomplished by an inner iteration; the latter approximates the product of the sign function of t...

2005
Yvan Notay

We consider inverse iteration-based eigensolvers, which require at each step solving an “inner” linear system. We assume that this linear system is solved by some (preconditioned) Krylov subspace method. In this framework, several approaches are possible, which differ by the linear system to be solved and/or the way the preconditioner is used. This includes methods such as inexact shift-and-inv...

Journal: :Numerical Linear Algebra With Applications 2022

We study an inexact inner–outer generalized Golub–Kahan algorithm for the solution of saddle-point problems with a two-times-two block structure. In each outer iteration, inner system has to be solved which in theory done exactly. Whenever is getting large, exact solver is, however, no longer efficient or even feasible and iterative methods must used. focus this article on numerical showing inf...

2007
Andrew P. Gray Chen Greif Tracy Lau

We present a stationary iterative scheme for PageRank computation. The algorithm is based on a linear system formulation of the problem, uses inner/outer iterations, and amounts to a simple preconditioning technique. It is simple, can be easily implemented and parallelized, and requires minimal storage overhead. Convergence analysis shows that the algorithm is effective for a crude inner tolera...

Journal: :SIAM J. Matrix Analysis Applications 2009
Michiel E. Hochstenbach Yvan Notay

The Jacobi–Davidson method is an eigenvalue solver which uses the iterative (and in general inaccurate) solution of inner linear systems to progress, in an outer iteration, towards a particular solution of the eigenproblem. In this paper we prove a relation between the residual norm of the inner linear system and the residual norm of the eigenvalue problem. We show that the latter may be estima...

2005
Xizhe Zhang Tianyang Lv Zhengxuan Wang

The iteration of complex function can generate beautiful fractal images. This paper presents a novel method based on the iteration of the distance ratio with two points, which generates a generalized Mandelbrot set according to distance ratio convergence times. This paper states the definition of distance ratio and its iteration. Then taking the complex function f(z)=z+c for example, it discuss...

Journal: :SIAM J. Numerical Analysis 2002
Eberhard Bänsch Pedro Morin Ricardo H. Nochetto

We introduce and study an adaptive finite element method (FEM) for the Stokes system based on an Uzawa outer iteration to update the pressure and an elliptic adaptive inner iteration for velocity. We show linear convergence in terms of the outer iteration counter for the pairs of spaces consisting of continuous finite elements of degree k for velocity, whereas for pressure the elements can be e...

2011
K. Subramani

Correctness: The first step is to choose a useful loop invariant. Consider the following invariant: At the end of the k iteration of the outer for loop, the array A[1 · · k] is sorted and A[k] is the k smallest element in A. Let us focus on the first execution of the outer for loop. In this case, the inner for loop executes (n− 1) times. After the inner for loop has executed for the first time,...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید