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. Inexact Barzilai-Borwein method for saddle point problems.
- Author
-
Yi-Qing Hu and Yu-Hong Dai
- Subjects
- *
METHOD of steepest descent (Numerical analysis) , *NUMERICAL analysis , *STOCHASTIC convergence , *ALGORITHMS , *LINEAR systems , *SYSTEMS theory - Abstract
This paper considers the inexact Barzilai–Borwein (BB) algorithm applied to saddle point problems. To this aim, we study the convergence properties of the inexact BB algorithm for symmetric positive definite linear systems. Suppose that gk and >ilde;k are the exact residual and its approximation of the linear system at the kth iteration, respectively. We prove the R-linear convergence of the algorithm if ∥>ilde;k – gk∥⩽η∥>ilde;k∥ for some small η>0 and all k. To adapt the algorithm for solving saddle point problems, we also extend the R-linear convergence result to the case when the right-hand term ∥>ilde;k∥ is replaced by ∥>ilde;k–1∥. Although our theoretical analyses cannot provide a good estimate to the parameter η, in practice, we find that η can be as large as the one in the inexact Uzawa algorithm. Further numerical experiments show that the inexact BB algorithm performs well for the tested saddle point problems. Copyright © 2007 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]
- Published
- 2007
- Full Text
- View/download PDF
4. Acceleration schemes for computing centroidal Voronoi tessellations.
- Author
-
Qiang Du and Emelianenko, Maria
- Subjects
- *
TESSELLATIONS (Mathematics) , *ALGORITHMS , *NUMERICAL analysis , *VECTOR algebra , *MATHEMATICAL models , *STOCHASTIC convergence - Abstract
Centroidal Voronoi tessellations (CVT) have diverse applications in many areas of science and engineering. The development of efficient algorithms for their construction is a key to their success in practice. In this paper, we study some new algorithms for the numerical computation of the CVT, including the Lloyd–Newton iteration and the optimization based multilevel method. Both theoretical analysis and computational simulations are conducted. Rigorous convergence results are presented and significant speedup in computation is demonstrated through the comparison with traditional methods. Copyright © 2006 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]
- Published
- 2006
- Full Text
- View/download PDF
5. Maximum-weight-basis preconditioners.
- Author
-
Boman, Erik G., Chen, Doron, Hendrickson, Bruce, and Toledo, Sivan
- Subjects
- *
MATRICES (Mathematics) , *ALGEBRA , *ALGORITHMS , *STOCHASTIC convergence , *NUMERICAL analysis - Abstract
This paper analyses a novel method for constructing preconditioners for diagonally dominant symmetric positive-definite matrices. The method discussed here is based on a simple idea: we construct M by simply dropping offdiagonal non-zeros from A and modifying the diagonal elements to maintain a certain row-sum property. The preconditioners are extensions of Vaidya's augmented maximum-spanning-tree preconditioners. The preconditioners presented here were also mentioned by Vaidya in an unpublished manuscript, but without a complete analysis. The preconditioners that we present have only O(n+t2) nonzeros, where n is the dimension of the matrix and 1⩽t⩽n is a parameter that one can choose. Their construction is efficient and guarantees that the condition number of the preconditioned system is O(n2/t2) if the number of nonzeros per row in the matrix is bounded by a constant. We have developed an efficient algorithm to construct these preconditioners and we have implemented it. We used our implementation to solve a simple model problem; we show the combinatorial structure of the preconditioners and we present encouraging convergence results. [ABSTRACT FROM AUTHOR]
- Published
- 2004
- Full Text
- View/download PDF
6. 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
7. 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
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.