首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 93 毫秒
1.
In [M. Brezina, P. Vaněk and P. S. Vassilevski, An improved convergence of smoothed aggregation algebraic multigrid, Numer. Linear Algebra Appl., 19 (2012), pp. 441–469], a uniform convergence bound for smoothed aggregation algebraic multigrid with aggressive coarsening and massive polynomial prolongator and multigrid smoothers is established provided that the number of smoothing steps is equal to the coarsening ratio parameter ν. The final convergence estimate needs the uniform bound for the constant Cν ∕ (2ν + 1). In this note, we give an improved upper bound. Copyright © 2013 John Wiley & Sons, Ltd.  相似文献   

2.
We prove that within the frame of smoothed prolongations, rapid coarsening between first two levels can be compensated by massive prolongation smoothing and pre- and post-smoothing derived from the prolongator smoother.  相似文献   

3.
In this paper, we consider the convergence rate of a smoothed aggregation algebraic multigrid method, which uses a simple polynomial (1 ? t)ν or an optimal Chebyshev‐like polynomial to construct the smoother and prolongation operator. The result is purely algebraic, whereas a required main weak approximation property of the tentative interpolation operator is verified for a spectral element agglomeration version of the method. More specifically, we prove that, for partial differential equations (PDEs), the two‐grid method converges uniformly without any regularity assumptions. Moreover, the convergence rate improves uniformly when the degree of the polynomials used for the smoother and the prolongation increases. Such a result, as is well‐known, would imply uniform convergence of the multilevel W‐cycle version of the algorithm. Numerical results, for both PDE and non‐PDE (graph Laplacian) problems are presented to illustrate the theoretical findings. Published 2016. This article is a U.S. Government work and is in the public domain in the USA.  相似文献   

4.
A new prolongator is proposed for smoothed aggregation (SA) multigrid. The proposed prolongator addresses a limitation of standard SA when it is applied to anisotropic problems. For anisotropic problems, it is fairly standard to generate small aggregates (used to mimic semi‐coarsening) in order to coarsen only in directions of strong coupling. Although beneficial to convergence, this can lead to a prohibitively large number of non‐zeros in the standard SA prolongator and the corresponding coarse discretization operator. To avoid this, the new prolongator modifies the standard prolongator by shifting support (non‐zeros within a prolongator column) from one aggregate to another to satisfy a specified non‐zero pattern. This leads to a sparser operator that can be used effectively within a multigrid V‐cycle. The key to this algorithm is that it preserves certain null space interpolation properties that are central to SA for both scalar and systems of partial differential equations (PDEs). We present two‐dimensional and three‐dimensional numerical experiments to demonstrate that the new method is competitive with standard SA for scalar problems, and significantly better for problems arising from PDE systems. Copyright © 2008 John Wiley & Sons, Ltd.  相似文献   

5.
We analyze a general multigrid method with aggressive coarsening and polynomial smoothing. We use a special polynomial smoother that originates in the context of the smoothed aggregation method. Assuming the degree of the smoothing polynomial is, on each level k, at least Ch k+1/h k , we prove a convergence result independent of h k+1/h k . The suggested smoother is cheaper than the overlapping Schwarz method that allows to prove the same result. Moreover, unlike in the case of the overlapping Schwarz method, analysis of our smoother is completely algebraic and independent of geometry of the problem and prolongators (the geometry of coarse spaces).  相似文献   

6.
We present an improved analysis of the smoothed aggregation algebraic multigrid method extending the original proof in [Numer. Math. 2001; 88 :559–579] and its modification in [Multilevel Block Factorization Preconditioners. Matrix‐based Analysis and Algorithms for Solving Finite Element Equations. Springer: New York, 2008]. The new result imposes fewer restrictions on the aggregates that makes it easier to verify in practice. Also, we extend a result in [Appl. Math. 2011] that allows us to use aggressive coarsening at all levels. This is due to the properties of the special polynomial smoother that we use and analyze. In particular, we obtain bounds in the multilevel convergence estimates that are independent of the coarsening ratio. Numerical illustration is also provided. Copyright © 2011 John Wiley & Sons, Ltd.  相似文献   

7.
The finite element (FE) solution of geotechnical elasticity problems leads to the solution of a large system of linear equations. For solving the system, we use the preconditioned conjugate gradient (PCG) method with two-level additive Schwarz preconditioner. The preconditioning is realised in parallel. A coarse space is usually constructed using an aggregation technique. If the finite element spaces for coarse and fine problems on structural grids are fully compatible, relations between elements of matrices of the coarse and fine problems can be derived. By generalization of these formulae, we obtain an overlapping aggregation technique for the construction of a coarse space with smoothed basis functions. The numerical tests are presented at the end of the paper.  相似文献   

8.
Convergence of algebraic multigrid based on smoothed aggregation   总被引:10,自引:0,他引:10  
Summary. We prove an abstract convergence estimate for the Algebraic Multigrid Method with prolongator defined by a disaggregation followed by a smoothing. The method input is the problem matrix and a matrix of the zero energy modes of the same problem but with natural boundary conditions. The construction is described in the case of a general elliptic system. The condition number bound increases only as a polynomial of the number of levels, and requires only a uniform weak approximation property for the aggregation operators. This property can be a-priori verified computationally once the aggregates are known. For illustration, it is also verified here for a uniformly elliptic diffusion equations discretized by linear conforming quasiuniform finite elements. Only very weak and natural assumptions on the hierarchy of aggregates are needed. Received March 1, 1998 / Revised version received January 28, 2000 / Published online: December 19, 2000  相似文献   

9.
In this paper, an inexact non-interior continuation method is proposed for semidefinite Programs. By a matrix mapping, the primal-dual optimal condition can be inverted into a smoothed nonlinear system of equations. A linear system of equations with residual vector is eventually driven by solving the smoothed nonlinear system of equations and finally solved by the conjugate residual method. The global and locally superlinear convergence are verified. Numerical results and comparisons indicate that the proposed methods are very promising and comparable to several interior-point and other exact non-interior continuation methods.  相似文献   

10.
Aleš Janka 《PAMM》2007,7(1):1025901-1025902
We discuss the advantages of using algebraic multigrid based on smoothed aggregation for solving indefinite linear problems. The ingredients of smoothed aggregation are used to construct a black-box monolithic multigrid method with indefinite coarse problems. Although we discuss some techniques for enforcing the uniform inf-sup stability on all coarse levels, numerical experiments suggest that it is not strictly necessary. The proposed multigrid preconditioner shows robust behaviour for different time-step parameters and even for very elongated geometries, where other techniques based on h -independent preconditioners of the pressure Schur complement lose their efficiency. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)  相似文献   

11.
In this paper we present an extension of Reusken's Lemma about the smoothing property of a multigrid method for solving non-symmetric linear systems of equations. One of the consequences of this extended lemma is the verification of the smoothing property for all damping factors oϵ(0, 1). Additionally, a semi-iterative smoother is constructed which gives, in some sense, optimal smoothing rate estimates.  相似文献   

12.
This paper studies spectral density estimation based on amplitude modulation including missing data as a specific case. A generalized periodogram is introduced and smoothed to give a consistent estimator of the spectral density by running local linear regression smoother. We explore the asymptotic properties of the proposed estimator and its application to time series data with periodic missing. A simple data-driven local bandwidth selection rule is proposed and an algorithm for computing the spectral density estimate is presented. The effectiveness of the proposed method is demonstrated using simulations. The application to outlier detection based on leave-one-out diagnostic is also considered. An illustrative example shows that the proposed diagnostic procedure succeeds in revealing outliers in time series without masking and smearing effects. Supported by Chinese NSF Grants 10001004 and 39930160, and Fellowship of City University of Hong Kong.  相似文献   

13.
Summary. The iterative aggregation method for the solution of linear systems is extended in several directions: to operators on Banach spaces; to the method with inexact correction, i.e., to methods where the (inner) linear system is in turn solved iteratively; and to the problem of finding stationary distributions of Markov operators. Local convergence is shown in all cases. Convergence results apply to the particular case of stochastic matrices. Moreover, an argument is given which suggests why the iterative aggregation method works so well for nearly uncoupled Markov chains, as well as for Markov chains with other zero-nonzero structures. Received May 25, 1991/Revised version received February 23, 1994  相似文献   

14.
This work is concerned with smoothed stochastic approximation/optimization algorithms. The main emphasis is placed on the asymptotic optimality issues. An algorithm with averaging in both state variables and observations is studied. Under correlated noise processes, it is shown that a scaled sequence of the iterates converges weakly to a Browman motion. As a result the algorithm is asymptotically optimal Numerical experiments are carried out. Comparisons are made among several algorithms for both linear and nonlinear functions. The numerical results yield good agreement with our analytical findings  相似文献   

15.
We study a multilevel Schwarz preconditioned Newton-Krylov algorithm to solve the Poisson-Boltzmann equation with applications in multi-particle colloidal simulation. The smoothed aggregation-type coarse mesh space is introduced in collaboration with the one-level Schwarz method as a composite preconditioner for accelerating the convergence of a Krylov subspace method for solving the Jacobian system at each Newton step. The important feature of the proposed solution algorithm is that the geometric mesh information needed for constructing the multilevel preconditioner is the same as the one-level Schwarz method on the fine mesh. Other components, such as the definition of the coarse mesh, all the mesh transfer operators, and the coarse mesh problem, are taken care of by the Trillinos/ML packages of the Sandia National Laboratories in the United States. After algorithmic parameter tuning, we show that the proposed smoothed aggregation multilevel Newton-Krylov-Schwarz (NKS) algorithm numerically outperforms than smoothed aggregation multigrid method and one-level version of the NKS algorithm with satisfactory parallel performances up to a few thousand cores. Besides, we investigate how the electrostatic forces between particles for the separation distance depend on the radius of spherical colloidal particles and valence ratios of cation and anion in a cubic system.  相似文献   

16.
Summary. The method of shortest residuals (SR) was presented by Hestenes and studied by Pytlak. If the function is quadratic, and if the line search is exact, then the SR method reduces to the linear conjugate gradient method. In this paper, we put forward the formulation of the SR method when the line search is inexact. We prove that, if stepsizes satisfy the strong Wolfe conditions, both the Fletcher-Reeves and Polak-Ribière-Polyak versions of the SR method converge globally. When the Wolfe conditions are used, the two versions are also convergent provided that the stepsizes are uniformly bounded; if the stepsizes are not bounded, an example is constructed to show that they need not converge. Numerical results show that the SR method is a promising alternative of the standard nonlinear conjugate gradient method. Received June 25, 1996 / Revised version received April 1, 1997 / Published online July 28, 1999  相似文献   

17.
A new smoothing approach was given for solving the mathematical programs with complementarity constraints (MPCC) by using the aggregation technique. As the smoothing parameter tends to zero, if the KKT point sequence generated from the smoothed problems satisfies the second-order necessary condition, then any accumulation point of the sequence is a B-stationary point of MPCC if the linear independence constraint qualification (LICQ) and the upper level strict complementarity (ULSC) condition hold at the limit point. The ULSC condition is weaker than the lower level strict complementarity (LLSC) condition generally used in the literatures. Moreover, the method can be easily extended to the mathematical programs with general vertical complementarity constraints.  相似文献   

18.
The iterative aggregation method for the solution of a system of linear algebraic equations x = Ax + b, where A ≥ 0, b ≥ 0, s > 0, and sA < s ′, is proved to be locally convergent. It is shown that the method can be considered a consistent nonstationary iterative method, where the iteration matrix depends on the current iterate, and that some norm of the iteration matrix is less than one in the vicinity of the solution.  相似文献   

19.

In this paper, we consider the linear systems arising from the standard finite element discretizations of certain second order anisotropic problems with variable coefficients on a rectangle. We study the performance of a V-cycle multigrid method applied to the finite element equations. Since the usual ``regularity and approximation' assumption does not hold for the anisotropic finite element problems, the standard multigrid convergence theory cannot be applied directly. In this paper, a modification of the theory of Braess and Hackbusch will be presented. We show that the V-cycle multigrid iteration with a line smoother is a uniform contraction in the energy norm. In the verification of the hypotheses in our theory, we use a weighted -norm estimate for the error in the Galerkin finite element approximation and a smoothing property of the line smoothers which is proved in this paper.

  相似文献   


20.
A framework is proposed for constructing algebraic multigrid transfer operators suitable for nonsymmetric positive definite linear systems. This framework follows a Schur complement perspective as this is suitable for both symmetric and nonsymmetric systems. In particular, a connection between algebraic multigrid and approximate block factorizations is explored. This connection demonstrates that the convergence rate of a two‐level model multigrid iteration is completely governed by how well the coarse discretization approximates a Schur complement operator. The new grid transfer algorithm is then based on computing a Schur complement but restricting the solution space of the corresponding grid transfers in a Galerkin‐style so that a far less expensive approximation is obtained. The final algorithm corresponds to a Richardson‐type iteration that is used to improve a simple initial prolongator or a simple initial restrictor. Numerical results are presented illustrating the performance of the resulting algebraic multigrid method on highly nonsymmetric systems. Copyright © 2013 John Wiley & Sons, Ltd.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号