7 results
Search Results
2. A practical two-term acceleration algorithm for linear systems.
- Author
-
Wang, Chuan-Long and Meng, Guo-Yan
- Subjects
LINEAR systems ,ACCELERATION (Mechanics) ,ALGORITHMS ,STOCHASTIC convergence ,INTERVAL analysis ,ITERATIVE methods (Mathematics) ,CHEBYSHEV systems ,NUMERICAL analysis - Abstract
SUMMARY In this paper, a practical two-term acceleration algorithm is proposed, the interval of the parameter which guarantees the convergence of the acceleration algorithm is analyzed in detail. Further, the acceleration ratio of the new acceleration algorithm is obtained in advance. The new acceleration algorithm is less sensitive to the parameter than the Chebyshev semi-iterative method. Finally, some numerical examples show that the accelerated algorithm is effective. Copyright © 2011 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]
- Published
- 2012
- Full Text
- View/download PDF
3. Minimizing synchronization in IDR ( s).
- Author
-
Collignon, Tijmen P. and van Gijzen, Martin B.
- Subjects
SYNCHRONIZATION ,ALGORITHMS ,ITERATIVE methods (Mathematics) ,MATHEMATICAL symmetry ,LINEAR systems ,GRID computing ,BOTTLENECKS (Manufacturing) ,CLUSTER analysis (Statistics) ,NUMERICAL analysis - Abstract
IDR ( s) is a family of fast algorithms for iteratively solving large nonsymmetric linear systems. With cluster computing and in particular with Grid computing, the inner product is a bottleneck operation. In this paper, three techniques are investigated for alleviating this bottleneck. First, a recently proposed IDR ( s) algorithm that is highly efficient and stable is reformulated in such a way that it has a single global synchronization point per iteration step. Second, the so-called test matrix is chosen so that the work, communication, and storage involving this matrix is minimized in multi-cluster environments. Finally, a methodology is presented for a-priori estimation of the optimal value of s using only problem and machine-based parameters. Numerical experiments applied to a 3D convection-diffusion problem are performed on the DAS-3 Grid computer, demonstrating the effectiveness of our approach. Copyright © 2011 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]
- Published
- 2011
- Full Text
- View/download PDF
4. The DEFLATED-GMRES(m, k) method with switching the restart frequency dynamically.
- Author
-
Moriya, Kentaro and Nodera, Takashi
- Subjects
ITERATIVE methods (Mathematics) ,NUMERICAL analysis ,LINEAR systems ,ALGORITHMS ,EIGENFUNCTIONS ,STOCHASTIC convergence ,SYSTEMS theory - Abstract
The DEFLATED-GMRES(m, k) method is one of the major iterative solvers for the large sparse linear systems of equations, x = b. This algorithm assembles a preconditioner adaptively for the GMRES(m) method based on eigencomponents gathered from the Arnoldi process during iterations. It is usually known that if a restarted GMRES(m) method is used to solve linear systems of equations, the information of the smallest eigencomponents is lost at each restart and the super-linear convergence may also be lost. In this paper, we propose an adaptive procedure that combines the DEFLATED-GMRES(m, k) algorithm and the determination of a restart frequency automatically. It is shown that a new algorithm combining elements of both will reduce the negative effects of the restarted procedure. The numerical experiments are presented on three test problems by using the MIMD parallel machine AP3000. From these numerical results, we show that the proposed algorithm leads to faster convergence than the conventional DEFLATED-GMRES(m, k) method. Copyright © 2000 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]
- Published
- 2000
- Full Text
- View/download PDF
5. On the Convergence Behavior of the Restarted GMRES Algorithm for Solving Nonsymmetric Linear Systems.
- Author
-
Joubert, Wayne
- Subjects
ITERATIVE methods (Mathematics) ,STOCHASTIC convergence ,LINEAR systems ,ALGORITHMS ,NUMERICAL analysis ,ALGEBRA ,CONJUGATE gradient methods ,NUMERICAL solutions to equations - Abstract
The solution of nonsymmetric systems of linear equations continues to be a difficult problem. A main algorithm for solving nonsymmetric problems is restarted GMRES. The algorithm is based on restarting full GMRES every s iterations, for some integer s > 0. This paper considers the impact of the restart frequency s on the convergence and work requirements of the method. It is shown that a good choice of this parameter can lead to reduced solution time, while an improper choice may hinder or preclude convergence. An adaptive procedure is also presented for determining automatically when to restart. The results of numerical experiments are presented. [ABSTRACT FROM AUTHOR]
- Published
- 1994
- Full Text
- View/download PDF
6. ITERATIVE ALGORITHMS AND SOFTWARE FOR SOLVING LARGE SPARSE LINEAR SYSTEMS.
- Author
-
Young, David M. and Tsun-Zee Mai
- Subjects
ALGORITHMS ,ITERATIVE methods (Mathematics) ,NUMERICAL analysis ,ALGEBRA ,LINEAR systems ,SYSTEMS theory - Abstract
The paper is concerned with iterative algorithms for solving systems of linear algebraic equations where the coefficient matrix is large and sparse. Such systems often arise in the numerical solution of partial differential equations by finite difference or finite element methods. The algorithms considered include a basic iterative method, an acceleration procedure for speeding up the convergence of the basic iterative method and an adaptive procedure for determining any necessary iteration parameters. Algorithms are described both for the case where the coefficient matrix is symmetric and positive definite and for the nonsymmetrizable case. The ITPACK Project was established by the Center for Numerical Analysis at The University of Texas in 1974. The object of ITPACK was the study of iterative algorithms, using both theoretical and experimental methods. Several software packages are described which have been developed as part of the ITPACK project for carrying out experimental studies with a variety of algorithms over a wide range of problems. Recent work on the use of advanced computer architectures is briefly discussed. [ABSTRACT FROM AUTHOR]
- Published
- 1988
- Full Text
- View/download PDF
7. Two-stage Multisplitting Methods with Overlapping Blocks.
- Author
-
Jones, Mark T. and Szyld, Daniel B.
- Subjects
LINEAR systems ,EQUATIONS ,SYSTEMS theory ,ITERATIVE methods (Mathematics) ,NUMERICAL analysis ,ALGORITHMS - Abstract
Parallel two-stage multisplitting methods with overlap for the solution of linear systems of algebraic equations are studied. It is shown that, under certain hypotheses, the method with overlap is asymptotically faster than that without overlap. Experiments illustrating this phenomenon are presented. [ABSTRACT FROM AUTHOR]
- Published
- 1996
- Full Text
- View/download PDF
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.