A Bound for thé Optimum Relaxation Factor for the Successive Overrelaxation Method.
A Class of Iterative Methods for Solving Saddle Point Problems.
A comparison of the accuracy of the finite-difference solution to boundary value problems for the Helmholtz equation obtained by direct and iterative methods
The development of iterative methods for solving linear algebraic equations has brought the question of when the employment of these methods is more advantageous than the use of the direct ones. In the paper, a comparison of the direct and iterative methods is attempted. The methods are applied to solving a certain class of boundary-value problems for elliptic partial differential equations which are used for the numerical modeling of electromagnetic fields in geophysics. The numerical experiments...
A Conjugate Gradient Method and a Multigrid Algorithm for Morley' s Finite Element Approximation of the Biharmonic Equation.
A fast solver for the first biharmonic boundary value problem.
A Generalization of the Schwarz Alternating Method to an Arbitrary Number of Subdomains.
A heat conduction problem involving phase change and its numerical solution by finite difference methods
A Legendre spectral collocation method for the biharmonic Dirichlet problem
A Legendre Spectral Collocation Method for the Biharmonic Dirichlet Problem
A Legendre spectral collocation method is presented for the solution of the biharmonic Dirichlet problem on a square. The solution and its Laplacian are approximated using the set of basis functions suggested by Shen, which are linear combinations of Legendre polynomials. A Schur complement approach is used to reduce the resulting linear system to one involving the approximation of the Laplacian of the solution on the two vertical sides of the square. The Schur complement system is solved by a...
A Mathematical Analysis of Miller's Algorithm.
A Multigrid Method for a Parameter Dependent Problem in Solid Mechanics.
A multilevel method with correction by aggregation for solving discrete elliptic problems
The author studies the behaviour of a multi-level method that combines the Jacobi iterations and the correction by aggragation of unknowns. Our considerations are restricted to a simple one-dimensional example, which allows us to employ the technique of the Fourier analysis. Despite of this restriction we are able to demonstrate differences between the behaviour of the algorithm considered and of multigrid methods employing interpolation instead of aggregation.
A multiscale mortar multipoint flux mixed finite element method
In this paper, we develop a multiscale mortar multipoint flux mixed finite element method for second order elliptic problems. The equations in the coarse elements (or subdomains) are discretized on a fine grid scale by a multipoint flux mixed finite element method that reduces to cell-centered finite differences on irregular grids. The subdomain grids do not have to match across the interfaces. Continuity of flux between coarse elements is imposed via a mortar finite element space on a coarse grid...
A multiscale mortar multipoint flux mixed finite element method
In this paper, we develop a multiscale mortar multipoint flux mixed finite element method for second order elliptic problems. The equations in the coarse elements (or subdomains) are discretized on a fine grid scale by a multipoint flux mixed finite element method that reduces to cell-centered finite differences on irregular grids. The subdomain grids do not have to match across the interfaces. Continuity of flux between coarse elements is imposed via a mortar finite element space on a coarse grid...
A multiscale mortar multipoint flux mixed finite element method
In this paper, we develop a multiscale mortar multipoint flux mixed finite element method for second order elliptic problems. The equations in the coarse elements (or subdomains) are discretized on a fine grid scale by a multipoint flux mixed finite element method that reduces to cell-centered finite differences on irregular grids. The subdomain grids do not have to match across the interfaces. Continuity of flux between coarse elements is imposed via a mortar finite element space on a coarse grid...
A new numerical scheme for non uniform homogenized problems: application to the nonlinear Reynolds compressible equation.
A Note on the Approximation of Mildly Nonlinear Dirichlet Problems by Finite Differences.
A numerical study on Neumann-Neumann methods for hp approximations on geometrically refined boundary layer meshes II. Three-dimensional problems
In this paper, we present extensive numerical tests showing the performance and robustness of a Balancing Neumann-Neumann method for the solution of algebraic linear systems arising from hp finite element approximations of scalar elliptic problems on geometrically refined boundary layer meshes in three dimensions. The numerical results are in good agreement with the theoretical bound for the condition number of the preconditioned operator derived in [Toselli and Vasseur, IMA J. Numer. Anal.24 (2004)...
A posteriori error estimators for the Stokes equations II non-conforming discretizations.
A preconditioner for the FETI-DP method for mortar-type Crouzeix-Raviart element discretization
In this paper, we consider mortar-type Crouzeix-Raviart element discretizations for second order elliptic problems with discontinuous coefficients. A preconditioner for the FETI-DP method is proposed. We prove that the condition number of the preconditioned operator is bounded by , where and are mesh sizes. Finally, numerical tests are presented to verify the theoretical results.