Iliev, O.; Lazarov, R.; Willems, J.
January 2007
Computational Methods in Applied Mathematics;2007, Vol. 7 Issue 1, p48
Academic Journal
Various advanced two-level iterative methods are studied numerically and compared with each other in conjunction with finite volume discretizations of symmetric 1-D elliptic problems with highly oscillatory discontinuous coefficients. Some of the methods considered rely on the homogenization approach for deriving the coarse grid operator. This approach is considered here as an alternative to the well-known Galerkin approach for deriving coarse grid operators. Different intergrid transfer operators are studied, primary consideration being given to the use of the so-called problem-dependent prolongation. The two-grid methods considered are used as both solvers and preconditioners for the Conjugate Gradient method. The recent approaches, such as the hybrid domain decomposition method introduced by Vassilevski and the globallocal iterative procedure proposed by Durlofsky et al. are also discussed. A two-level method converging in one iteration in the case where the right-hand side is only a function of the coarse variable is introduced and discussed. Such a fast convergence for problems with discontinuous coefficients arbitrarily varying on the fine scale is achieved by a problem-dependent selection of the coarse grid combined with problem-dependent prolongation on a dual grid. The results of the numerical experiments are presented to illustrate the performance of the studied approaches.


Related Articles

  • On the Behavior of the Residual in Conjugate Gradient Method. Washizawa, Teruyoshi // Applied Mathematics;Sep2010, Vol. 1 Issue 3, p211 

    In conjugate gradient method, it is well known that the recursively computed residual differs from true one as the iteration proceeds in finite arithmetic. Some work have been devoted to analyze this behavior and to evaluate the lower and the upper bounds of the difference. This paper focuses on...

  • CONVERGENCE OF ALGORITHMS FOR PERTURBED OPTIMIZATION PROBLEMS. Sachs, Ekkerhard W. // Annals of Operations Research;1990, Vol. 27 Issue 1-4, p311 

    Infinite-dimensional optimization problems occur in various applications such as optimal control problems and parameter identification problems. If these problems are solved numerically the methods require a discretization which can be viewed as a perturbation of the data of the optimization...

  • Rate of Convergence Analysis of Discretization and Smoothing Algorithms for Semiinfinite Minimax Problems. Royset, J.; Pee, E. // Journal of Optimization Theory & Applications;Dec2012, Vol. 155 Issue 3, p855 

    Discretization algorithms for semiinfinite minimax problems replace the original problem, containing an infinite number of functions, by an approximation involving a finite number, and then solve the resulting approximate problem. The approximation gives rise to a discretization error, and...

  • ANOTHER MODIFIED DPRP CONJUGATE GRADIENT METHOD WITH GLOBAL CONVERGENT PROPERTIES. Kamfa, Kamilu; Mamat, Mustafa; Rivaie, Mohd; Abashar, Abdelrhaman; Salleh, Zabidin // Far East Journal of Mathematical Sciences;Nov2015, Vol. 98 Issue 5, p563 

    Conjugate gradient (CG) methods play significant role in solving large scale unconstrained optimization problem, due to their low memory requirement and global convergent properties. For many years, different studies and modification have been carried out to improve this method. In this paper,...

  • A Conjugate Gradient Type Method for the Nonnegative Constraints Optimization Problems. Can Li // Journal of Applied Mathematics;2013, p1 

    We are concerned with the nonnegative constraints optimization problems. It iswell known that the conjugate gradient methods are efficient methods for solving large-scale unconstrained optimization problems due to their simplicity and low storage. Combining the modified Polak-Ribi`ere-Polyak...

  • A stable primal�dual approach for linear programming under nondegeneracy assumptions. Gonzalez-Lima, Maria; Wei, Hua; Wolkowicz, Henry // Computational Optimization & Applications;Nov2009, Vol. 44 Issue 2, p213 

    This paper studies a primal�dual interior/exterior-point path-following approach for linear programming that is motivated on using an iterative solver rather than a direct solver for the search direction. We begin with the usual perturbed primal�dual optimality equations. Under...

  • Inexact Coordinate Descent: Complexity and Preconditioning. Tappenden, Rachael; Richtárik, Peter; Gondzio, Jacek // Journal of Optimization Theory & Applications;Jul2016, Vol. 170 Issue 1, p144 

    One of the key steps at each iteration of a randomized block coordinate descent method consists in determining the update to a block of variables. Existing algorithms assume that in order to compute the update, a particular subproblem is solved exactly. In this work, we relax this requirement...

  • Modification of the Armijo line search to satisfy the convergence properties of HS method. Belloufi, Mohammed; Benzine, Rachid; Laskri, Yamina // International Journal of Optimization & Control: Theories & Appl;Jul2013, Vol. 3 Issue 2, p145 

    The Hestenes-Stiefel (HS) conjugate gradient algorithm is a useful tool of unconstrained numerical optimization, which has good numerical performance but no global convergence result under traditional line searches. This paper proposes a line search technique that guarantee the global...

  • A Mixed Spectral CD-DY Conjugate Gradient Method. Liu Jinkui; Du Xianglin; Wang Kairong // Journal of Applied Mathematics;2012, p1 

    A mixed spectral CD-DY conjugate descent method for solving unconstrained optimization problems is proposed, which combines the advantages of the spectral conjugate gradient method, the CD method, and the DY method. Under the Wolfe line search, the proposed method can generate a descent...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics