共查询到20条相似文献，搜索用时 15 毫秒
1.
Yunhui He 《Numerical Linear Algebra with Applications》2023,30(6):e2514
We consider a block-structured multigrid method based on Braess–Sarazin relaxation for solving the Stokes–Darcy Brinkman equations discretized by the marker and cell scheme. In the relaxation scheme, an element-based additive Vanka operator is used to approximate the inverse of the corresponding shifted Laplacian operator involved in the discrete Stokes–Darcy Brinkman system. Using local Fourier analysis, we present the stencil for the additive Vanka smoother and derive an optimal smoothing factor for Vanka-based Braess–Sarazin relaxation for the Stokes–Darcy Brinkman equations. Although the optimal damping parameter is dependent on meshsize and physical parameter, it is very close to one. In practice, we find that using three sweeps of Jacobi relaxation on the Schur complement system is sufficient. Numerical results of two-grid and V(1,1)-cycle are presented, which show high efficiency of the proposed relaxation scheme and its robustness to physical parameters and the meshsize. Using a damping parameter equal to one gives almost the same convergence results as these for the optimal damping parameter. 相似文献
2.
In this work, we consider numerical methods for solving a class of block three‐by‐three saddle‐point problems, which arise from finite element methods for solving time‐dependent Maxwell equations and some other applications. The direct extension of the Uzawa method for solving this block three‐by‐three saddle‐point problem requires the exact solution of a symmetric indefinite system of linear equations at each step. To avoid heavy computations at each step, we propose an inexact Uzawa method, which solves the symmetric indefinite linear system in some inexact way. Under suitable assumptions, we show that the inexact Uzawa method converges to the unique solution of the saddle‐point problem within the approximation level. Two special algorithms are customized for the inexact Uzawa method combining the splitting iteration method and a preconditioning technique, respectively. Numerical experiments are presented, which demonstrated the usefulness of the inexact Uzawa method and the two customized algorithms. 相似文献
3.
U. Hetmaniuk 《Numerical Linear Algebra with Applications》2007,14(7):563-580
This paper presents a new algebraic extension of the Rayleigh quotient multigrid (RQMG) minimization algorithm to compute the smallest eigenpairs of a symmetric positive definite pencil ( A , M ). Earlier versions of RQMG minimize the Rayleigh quotient over a hierarchy of geometric grids. We replace the geometric mesh information with the algebraic information defined by an algebraic multigrid preconditioner. At each level, we minimize the Rayleigh quotient with a block preconditioned algorithm. Numerical experiments illustrate the efficiency of this new algorithm to compute several eigenpairs. Copyright © 2007 John Wiley & Sons, Ltd. 相似文献
4.
This paper proposes and analyzes a class of multigrid smoothers called the parallel multiplicative (PM) smoother by subspace decomposition techniques. It shows that the well known additive and multiplicative smoothers and the JSOR smoother are special cases of the PM smoother, and their smoothing properties can be obtained directly from the PM analysis. Moreover, numerical results are presented in this paper to show that the JSOR smoother is more robust and effective than the damped Jacobi smoother on current MIMD parallel computers.
AMS subject classification (2000) 65N55, 65Y05.Received May 2004. Revised September 2004. Communicated by Per Lötstedt.Dexuan Xie: This work was partially supported by the National Science Foundation through grant DMS-0241236. 相似文献
5.
In this paper a stabilizing augmented Lagrangian technique for the Stokes equations is studied. The method is consistent and hence does not change the continuous solution. We show that this stabilization improves the well-posedness of the continuous problem for small values of the viscosity coefficient. We analyze the influence of this stabilization on the accuracy of the finite element solution and on the convergence properties of the inexact Uzawa method.
6.
Aleš Janka 《Numerical Algorithms》2003,33(1-4):319-330
A finite-volume based linear multigrid algorithm is proposed and used within an implicit linearized scheme to solve Navier–Stokes equations for compressible laminar flows. Coarse level problems are constructed algebraically based on convective and diffusive fluxes, without the knowledge of coarse geometry. Numerical results for complex 2D geometries such as airfoils, including stretched meshes, show mesh size independent convergence and efficiency of the method compared to other finite-volume-based multigrid method. 相似文献
7.
Jurjen Duintjer Tebbens Miroslav Tůma 《Numerical Linear Algebra with Applications》2010,17(6):997-1019
We present two new ways of preconditioning sequences of nonsymmetric linear systems in the special case where the implementation is matrix free. Both approaches are fully algebraic, they are based on the general updates of incomplete LU decompositions recently introduced in (SIAM J. Sci. Comput. 2007; 29 (5):1918–1941), and they may be directly embedded into nonlinear algebraic solvers. The first of the approaches uses a new model of partial matrix estimation to compute the updates. The second approach exploits separability of function components to apply the updated factorized preconditioner via function evaluations with the discretized operator. Experiments with matrix‐free implementations of test problems show that both new techniques offer useful, robust and black‐box solution strategies. In addition, they show that the new techniques are often more efficient in matrix‐free environment than either recomputing the preconditioner from scratch for every linear system of the sequence or than freezing the preconditioner throughout the whole sequence. Copyright © 2010 John Wiley & Sons, Ltd. 相似文献
8.
Maxim A. Olshanskii 《Numerical Linear Algebra with Applications》1999,6(5):353-378
Incompressible unsteady Navier–Stokes equations in pressure–velocity variables are considered. By use of the implicit and semi‐implicit schemes presented the resulting system of linear equations can be solved by a robust and efficient iterative method. This iterative solver is constructed for the system of linearized Navier–Stokes equations. The Schur complement technique is used. We present a new approach of building a non‐symmetric preconditioner to solve a non‐symmetric problem of convection–diffusion and saddle‐point type. It is shown that handling the differential equations properly results in constructing efficient solvers for the corresponding finite linear algebra systems. The method has good performance for various ranges of viscosity and can be used both for 2D and 3D problems. The analysis of the method is still partly heuristic, however, the mathematically rigorous results are proved for certain cases. The proof is based on energy estimates and basic properties of the underlying partial differential equations. Numerical results are provided. Additionally, a multigrid method for the auxiliary convection–diffusion problem is briefly discussed. Copyright © 1999 John Wiley & Sons, Ltd. 相似文献
9.
We propose an optimal computational complexity algorithm for the solution of quadratic programming problems with equality constraints arising from partial differential equations. The algorithm combines a variant of the semi‐monotonic augmented Lagrangian (SMALE) method with adaptive precision control and a multigrid preconditioning for the Hessian of the cost function and for the inner product on the space of Lagrange variables. The update rule for penalty parameter acts as preconditioning of constraints. The optimality of the algorithm is theoretically proven and confirmed by numerical experiments for the two‐dimensional Stokes problem. Copyright © 2007 John Wiley & Sons, Ltd. 相似文献
10.
Vladislav Pimanov;Oleg Iliev;Ivan Oseledets;Ekaterina Muravleva; 《Numerical Linear Algebra with Applications》2024,31(6):e2581
It is known (see, e.g., [SIAM J. Matrix Anal. Appl. 2014;35(1):143-173]) that the performance of iterative methods for solving the Stokes problem essentially depends on the quality of the preconditioner for the Schur complement matrix, S$$ S $$. In this paper, we consider two preconditioners for S$$ S $$: the identity one and the SIMPLE one, and numerically study their performance for solving the Stokes problem in tight geometries. The latter are characterized by a high surface-to-volume ratio. We show that for such geometries, S$$ S $$ can become severely ill-conditioned, having a very large condition number and a significant portion of non-unit eigenvalues. As a consequence, the identity matrix, which is broadly used as a preconditioner for solving the Stokes problem in simple geometries, becomes very inefficient. We show that there is a correlation between the surface-to-volume ratio and the condition number of S$$ S $$: the latter increases with the increase of the former. We show that the condition number of the diffusive SIMPLE-preconditioned Schur complement matrix remains bounded when the surface-to-volume ratio increases, which explains the robust performance of this preconditioner for tight geometries. Further on, we use a direct method to calculate the full spectrum of S$$ S $$ and show that there is a correlation between the number of its non-unit eigenvalues and the number of grid points at which no-slip boundary conditions are prescribed. To illustrate the above findings, we examine the Pressure Schur Complement formulation for staggered finite-difference discretization of the Stokes equations and solve it with the preconditioned conjugate gradient method. The practical problem which is of interest to us is computing the permeability of tight rocks. 相似文献
11.
R. Webster 《Numerical Linear Algebra with Applications》2010,17(1):17-42
This paper presents the results of numerical experiments on the use of equal‐order and mixed‐order interpolations in algebraic multigrid (AMG) solvers for the fully coupled equations of incompressible fluid flow. Several standard test problems are addressed for Reynolds numbers spanning the laminar range. The range of unstructured meshes spans over two orders of problem size (over one order of mesh bandwidth). Deficiencies in performance are identified for AMG based on equal‐order interpolations (both zero‐order and first‐order). They take the form of poor, fragile, mesh‐dependent convergence rates. The evidence suggests that a degraded representation of the inter‐field coupling in the coarse‐grid approximation is the cause. Mixed‐order interpolation (first‐order for the vectors, zero‐order for the scalars) is shown to address these deficiencies. Convergence is then robust, independent of the number of coarse grids and (almost) of the mesh bandwidth. The AMG algorithms used are reviewed. Copyright © 2009 John Wiley & Sons, Ltd. 相似文献
12.
Durazzi C. Ruggiero V. Zanghirati G. 《Journal of Optimization Theory and Applications》2001,110(2):289-313
This paper concerns the use of iterative solvers in interior-point methods for linear and quadratic programming problems. We state an adaptive termination rule for the inner iterative scheme and we prove the global convergence of the obtained algorithm, exploiting the theory developed for inexact Newton methods. This approach is promising for problems with special structure on parallel computers. We present an application on Cray T3E/256 and SGI Origin 2000/64 arising in stochastic linear programming and robust optimization, where the constraint matrix is block-angular and extremely large. 相似文献
13.
The well-known Reid–Harris expansions, applied to the stream function formulation, and the projection–diffusion Chebyshev Stokes solver, in primitive variables, are used to compute the fundamental Stokes eigenmodes of each of the symmetry families characterizing the Stokes solutions in the square. The numerical accuracy of both methods, applied with several discretizations, are compared, for both the eigenvalues and the main features of the corresponding eigenmodes. The Chebyshev approach is by far the most efficient, even though the associated solver does not provide a divergence free velocity but asymptotically. 相似文献
14.
Shangyou Zhang. 《Mathematics of Computation》2005,74(250):543-554
A natural mixed-element approach for the Stokes equations in the velocity-pressure formulation would approximate the velocity by continuous piecewise-polynomials and would approximate the pressure by discontinuous piecewise-polynomials of one degree lower. However, many such elements are unstable in 2D and 3D. This paper is devoted to proving that the mixed finite elements of this - type when satisfy the stability condition--the Babuska-Brezzi inequality on macro-tetrahedra meshes where each big tetrahedron is subdivided into four subtetrahedra. This type of mesh simplifies the implementation since it has no restrictions on the initial mesh. The new element also suits the multigrid method.
15.
对一类具有非线性滑动边界条件的Stokes问题,得到了求其数值解的自适应Uzawa块松弛算法（SUBRM）.通过该问题导出的变分问题,引入辅助变量将原问题转化为一个基于增广Lagrange函数表示的鞍点问题,并采用Uzawa块松弛算法（UBRM）求解.为了提高算法性能,提出利用迭代函数自动选取合适罚参数的自适应法则.该算法的优点是每次迭代只需计算一个线性问题,同时显式计算辅助变量.对算法的收敛性进行了理论分析,最后用数值结果验证了该算法的可行性和有效性. 相似文献
16.
In this paper, a new multilevel correction scheme is proposed to solve Stokes eigenvalue problems by the finite element method. This new scheme contains a series of correction steps, and the accuracy of eigenpair approximation can be improved after each step. In each correction step, we only need to solve a Stokes problem on the corresponding fine finite element space and a Stokes eigenvalue problem on the coarsest finite element space. This correction scheme can improve the efficiency of solving Stokes eigenvalue problems by the finite element method. As applications of this multilevel correction method, a multigrid method and an adaptive finite element technique are introduced for Stokes eigenvalue problems. Some numerical results are given to validate our schemes. Copyright © 2013 John Wiley & Sons, Ltd. 相似文献
17.
We construct and investigate additive iterative methods of complete approximation for solving stationary problems of mathematical physics. We prove the convergence of the proposed methods and obtain error estimates without the requirement of commutativity of the decomposition operators. We provide the results of a computational experiment for a three-dimensional boundary-value problem. We consider possible generalizations of algorithms for equations with mixed derivatives and Navier–Stokes equation systems. 相似文献
18.
Algebraic multigrid (AMG) preconditioners are considered for discretized systems of partial differential equations (PDEs) where unknowns associated with different physical quantities are not necessarily colocated at mesh points. Specifically, we investigate a Q 2? Q 1 mixed finite element discretization of the incompressible Navier–Stokes equations where the number of velocity nodes is much greater than the number of pressure nodes. Consequently, some velocity degrees of freedom (DOFs) are defined at spatial locations where there are no corresponding pressure DOFs. Thus, AMG approaches leveraging this colocated structure are not applicable. This paper instead proposes an automatic AMG coarsening that mimics certain pressure/velocity DOF relationships of the Q 2? Q 1 discretization. The main idea is to first automatically define coarse pressures in a somewhat standard AMG fashion and then to carefully (but automatically) choose coarse velocity unknowns so that the spatial location relationship between pressure and velocity DOFs resembles that on the finest grid. To define coefficients within the intergrid transfers, an energy minimization AMG (EMIN‐AMG) is utilized. EMIN‐AMG is not tied to specific coarsening schemes and grid transfer sparsity patterns, and so it is applicable to the proposed coarsening. Numerical results highlighting solver performance are given on Stokes and incompressible Navier–Stokes problems. 相似文献
19.
20.
Carlos Andres Bustamante Henry Power Whady Felipe Florez 《Numerical Methods for Partial Differential Equations》2015,31(3):777-797
The method of approximate particular solutions (MAPS) is used to solve the two‐dimensional Navier–Stokes equations. This method uses particular solutions of a nonhomogeneous Stokes problem, with the multiquadric radial basis function as a nonhomogeneous term, to approximate the velocity and pressure fields. The continuity equation is not explicitly imposed since the used particular solutions are mass conservative. To improve the computational efficiency of the global MAPS, the domain is split into overlapped subdomains where the Schwarz Alternating Algorithm is employed using velocity or traction values from neighboring subdomains as boundary conditions. When imposing only velocity boundary conditions, an extra step is required to find a reference value for the pressure at each subdomain to guarantee continuity of pressure across subdomains. The Stokes lid‐driven cavity flow problem is solved to assess the performance of the Schwarz algorithm in comparison to a finite‐difference‐type localized MAPS. The Kovasznay flow problem is used to validate the proposed numerical scheme. Despite the use of relative coarse nodal distributions, numerical results show excellent agreement with respect to results reported in literature when solving the lid‐driven cavity (up to Re = 10,000) and the backward facing step (at Re = 800) problems. © 2014 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 31: 777–797, 2015 相似文献