نتایج جستجو برای: successive over relaxation method

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

2015
I. K. Youssef M. M. Farid

A new variant of the accelerated over relaxation (AOR) method for solving systems of linear algebraic equations, the KAOR method is established. The treatment depends on the use of the extrapolation techniques introduced by Hadjidimos (1978) and the KSOR introduced by Youssef (2012) and its modified version published in (2013). The KAOR is an extrapolation version of the KSOR. This approach has...

Journal: :Math. Program. Comput. 2014
Natashia Boland Andrew C. Eberhard Faramroze G. Engineer Matteo Fischetti Martin W. P. Savelsbergh Angelos Tsoukalas

The Feasibility Pump (FP) has proved to be an effective method for finding feasible solutions to mixed integer programming problems. FP iterates between a rounding procedure and a projection procedure, which together provide a sequence of points alternating between LP relaxation feasible but fractional solutions, and integer but LP relaxation infeasible solutions. The process attempts to minimi...

1999
Shlomo Havlin Armin Bunde Joseph Klafter

We present results on dynamical processes that exhibit a stretched exponential relaxation. When the relaxation is a result of two competing exponential processes, the size of the system, although macroscopic, play a dominant role. There exist a crossover time t× that depends logarithmically on the size of the system, above which, the relaxation changes from a stretched exponential to a simple e...

2010
Stuart Lynn

The asymptotic behavior of the round-off error, which accumulates when the well-known iterative method of (point) successive over-relaxation is used to solve a large-scale system of linear equations, is examined by means of a statistical model. The local round-off errors are treated as independent random variables and expressions for the mean and variance of the accumulated round-off error are ...

2009
F. Paletou E. Anterrieu

This study concerns the fast and accurate solution of the line radiation transfer problem, under non-LTE conditions. We propose and evaluate an alternative iterative scheme to the classical ALI-Jacobi method, and to the more recently proposed Gauss-Seidel and Successive Over-Relaxation (GS/SOR) schemes. Our study is indeed based on the application of a preconditioned bi-conjugate gradient metho...

Journal: :Perform. Eval. 2000
Víctor Suñé José L. Domingo Juan A. Carrasco

In this paper we deal with iterative numerical methods to solve linear systems arising in continuous-time Markov chain (CTMC) models. We develop an algorithm to dynamically tune the relaxation parameter of the successive over-relaxation method. We give a sufficient condition for the Gauss-Seidel method to converge when computing the steady-state probability vector of a finite irreducible CTMC, ...

Journal: :Int. J. Computational Intelligence Systems 2016
H. Zareamoghaddam Anthony T. Chronopoulos M. Nouri Kadijani Z. Zareamoghaddam

Recently, there have been many studies on solving different kinds of fuzzy equations. In this paper, the solution of a trapezoidal fully fuzzy linear system (FFLS) is studied. Uzawa approach, which is a popular iterative technique for saddle point problems, is considered for solving such FFLSs. In our Uzawa approach, it is possible to compute the solution of a fuzzy system using various relaxat...

2009
Robert Krauthgamer Joseph Naor Roy Schwartz

We consider the k-balanced partitioning problem, where the goal is to partition the vertices of an input graph G into k equally sized components, while minimizing the total weight of the edges connecting different components. We allow k to be part of the input and denote the cardinality of the vertex set by n. This problem is a natural and important generalization of well-known graph partitioni...

2015
Zachary Friggstad Zhihan Gao

We study some linear programming relaxations for the Unsplittable Flow problem on trees (UFPtree). Inspired by results obtained by Chekuri, Ene, and Korula for Unsplittable Flow on paths (UFP-path), we present a relaxation with polynomially many constraints that has an integrality gap bound of O(logn ·min{logm, logn}) where n denotes the number of tasks and m denotes the number of edges in the ...

1995
Mark Reichelt

In this paper we describe a novel generalized SOR algorithm for accelerating the convergence of the dynamic iteration method known as waveform relaxation. A new convolution SOR algorithm is presented, along with a theorem for determining the optimal convolution SOR parameter. Both analytic and experimental results are given to demonstrate that the convergence of the convolution SOR algorithm is...

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

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