Schur complements on Hilbert spaces and saddle point systems

For any continuous bilinear form defined on a pair of Hilbert spaces satisfying the compatibility Ladyshenskaya–Babušca–Brezzi condition, symmetric Schur complement operators can be defined on each of the two Hilbert spaces. In this paper, we find bounds for the spectrum of the Schur operators only in terms of the compatibility and continuity constants. In light of the new spectral results for the Schur complements, we review the classical Babušca–Brezzi theory, find sharp stability estimates, and improve a convergence result for the inexact Uzawa algorithm. We prove that for any symmetric saddle point problem, the inexact Uzawa algorithm converges, provided that the inexact process for inverting the residual at each step has the relative error smaller than 1/3. As a consequence, we provide a new type of algorithm for discretizing saddle point problems, which combines the inexact Uzawa iterations with standard a posteriori error analysis and does not require the discrete stability conditions.     

Two new variants of nonlinear inexact Uzawa algorithms for saddle-point problems

Summary. In this paper, we consider some nonlinear inexact Uzawa methods for iteratively solving linear saddle-point problems. By means of a new technique, we first give an essential improvement on the convergence results of Bramble-Paschiak-Vassilev for a known nonlinear inexact Uzawa algorithm. Then we propose two new algorithms, which can be viewed as a combination of the known nonlinear inexact Uzawa method with the classical steepest descent method and conjugate gradient method respectively. The two new algorithms converge under very practical conditions and do not require any apriori estimates on the minimal and maximal eigenvalues of the preconditioned systems involved, including the preconditioned Schur complement. Numerical results of the algorithms applied for the Stokes problem and a purely linear system of algebraic equations are presented to show the efficiency of the algorithms. Received December 8, 1999 / Revised version received September 8, 2001 / Published online March 8, 2002 RID="*" ID="*" The work of this author was partially supported by a grant from The Institute of Mathematical Sciences, CUHK RID="**" ID="**" The work of this author was partially supported by Hong Kong RGC Grants CUHK 4292/00P and CUHK 4244/01P     

On local Hermitian and skew-Hermitian splitting iteration methods for generalized saddle point problems

In this paper, we first present a local Hermitian and skew-Hermitian splitting (LHSS) iteration method for solving a class of generalized saddle point problems. The new method converges to the solution under suitable restrictions on the preconditioning matrix. Then we give a modified LHSS (MLHSS) iteration method, and further extend it to the generalized saddle point problems, obtaining the so-called generalized MLHSS (GMLHSS) iteration method. Numerical experiments for a model Navier-Stokes problem are given, and the results show that the new methods outperform the classical Uzawa method and the inexact parameterized Uzawa method.     

An augmented mixed finite element method for 3D linear elasticity problems

In this paper we introduce and analyze a new augmented mixed finite element method for linear elasticity problems in 3D. Our approach is an extension of a technique developed recently for plane elasticity, which is based on the introduction of consistent terms of Galerkin least-squares type. We consider non-homogeneous and homogeneous Dirichlet boundary conditions and prove that the resulting augmented variational formulations lead to strongly coercive bilinear forms. In this way, the associated Galerkin schemes become well posed for arbitrary choices of the corresponding finite element subspaces. In particular, Raviart-Thomas spaces of order 0 for the stress tensor, continuous piecewise linear elements for the displacement, and piecewise constants for the rotation can be utilized. Moreover, we show that in this case the number of unknowns behaves approximately as 9.5 times the number of elements (tetrahedrons) of the triangulation, which is cheaper, by a factor of 3, than the classical PEERS in 3D. Several numerical results illustrating the good performance of the augmented schemes are provided.     

Implementation of a modified Marder–Weitzner method for solving nonlinear eigenvalue problems

Our goal is to propose four versions of modified Marder–Weitzner methods and to present the implementation of the new-type methods with incremental unknowns for solving nonlinear eigenvalue problems. By combining with compact schemes and modified Marder–Weitzner methods, six schemes well suited for the calculation of unstable solutions are obtained. We illustrate the efficiency of the new algorithms by using numerical computations and by comparing them with existing methods for some two-dimensional problems.     

On structure-oriented hybrid two-stage iteration methods for the large and sparse blocked system of linear equations

In this paper, we first present a class of structure-oriented hybrid two-stage iteration methods for solving the large and sparse blocked system of linear equations, as well as the saddle point problem as a special case. And the new methods converge to the solution under suitable restrictions, for instance, when the coefficient matrix is positive stable matrix generally. Numerical experiments for a model generalized saddle point problem are given, and the results show that our new methods are feasible and efficient, and converge faster than the Classical Uzawa Method.     

A posteriori dual-mixed adaptive finite element error control for Lamé and Stokes equations

A unified and robust mathematical model for compressible and incompressible linear elasticity can be obtained by rephrasing the Herrmann formulation within the Hellinger-Reissner principle. This quasi-optimally converging extension of PEERS (Plane Elasticity Element with Reduced Symmetry) is called Dual-Mixed Hybrid formulation (DMH). Explicit residual-based a posteriori error estimates for DMH are introduced and are mathematically shown to be locking-free, reliable, and efficient. The estimator serves as a refinement indicator in an adaptive algorithm for effective automatic mesh generation. Numerical evidence supports that the adaptive scheme leads to optimal convergence for Lamé and Stokes benchmark problems with singularities.     

Existence and approximation results for shape optimization problems in rotordynamics

We consider a shape optimization problem in rotordynamics where the mass of a rotor is minimized subject to constraints on the natural frequencies. Our analysis is based on a class of rotors described by a Rayleigh beam model including effects of rotary inertia and gyroscopic moments. The solution of the equation of motion leads to a generalized eigenvalue problem. The governing operators are non-symmetric due to the gyroscopic terms. We prove the existence of solutions for the optimization problem by using the theory of compact operators. For the numerical treatment of the problem a finite element discretization based on a variational formulation is considered. Applying results on spectral approximation of linear operators we prove that the solution of the discretized optimization problem converges towards the solution of the continuous problem if the discretization parameter tends to zero. Finally, a priori estimates for the convergence order of the eigenvalues are presented and illustrated by a numerical example.     

Linear and bilinear immersed finite elements for planar elasticity interface problems

This article is to discuss the linear (which was proposed in  and ) and bilinear immersed finite element (IFE) methods for solving planar elasticity interface problems with structured Cartesian meshes. Basic features of linear and bilinear IFE functions, including the unisolvent property, will be discussed. While both methods have comparable accuracy, the bilinear IFE method requires less time for assembling its algebraic system. Our analysis further indicates that the bilinear IFE functions are guaranteed to be applicable to a larger class of elasticity interface problems than linear IFE functions. Numerical examples are provided to demonstrate that both linear and bilinear IFE spaces have the optimal approximation capability, and that numerical solutions produced by a Galerkin method with these IFE functions for elasticity interface problem also converge optimally in both L²$L^2$ and semi-H¹$H^1$ norms.     

Static condensation,partial orthogonalization of basis functions,and ILU preconditioning in the hp-FEM

Static condensation of internal degrees of freedom, partial orthogonalization of basis functions, and ILU preconditioning are techniques used to facilitate the solution of discrete problems obtained in the hp-FEM. This paper shows that for symmetric linear (not necessarily positive-definite) problems, under mild technical assumptions, these three techniques are completely equivalent. In fact, the same matrices can be obtained by the same arithmetic operations. The study can be extended to nonsymmetric problems naturally.     

New choices of preconditioning matrices for generalized inexact parameterized iterative methods

For large sparse saddle point problems, Chen and Jiang recently studied a class of generalized inexact parameterized iterative methods (see [F. Chen, Y.-L. Jiang, A generalization of the inexact parameterized Uzawa methods for saddle point problems, Appl. Math. Comput. 206 (2008) 765-771]). In this paper, the methods are modified and some choices of preconditioning matrices are given. These preconditioning matrices have advantages in solving large sparse linear system. Numerical experiments of a model Stokes problem are presented.     

A meshfree numerical method for acoustic wave propagation problems in planar domains with corners and cracks

The numerical solution of acoustic wave propagation problems in planar domains with corners and cracks is considered. Since the exact solution of such problems is singular in the neighborhood of the geometric singularities the standard meshfree methods, based on global interpolation by analytic functions, show low accuracy. In order to circumvent this issue, a meshfree modification of the method of fundamental solutions is developed, where the approximation basis is enriched by an extra span of corner adapted non-smooth shape functions. The high accuracy of the new method is illustrated by solving several boundary value problems for the Helmholtz equation, modelling physical phenomena from the fields of room acoustics and acoustic resonance.     

A dual-parametric finite element method for cavitation in nonlinear elasticity

A dual-parametric finite element method is introduced in this paper for the computation of singular minimizers in the 2D cavitation problem in nonlinear elasticity. The method overcomes the difficulties, such as the mesh entanglement and material interpenetration, generally encountered in the finite element approximation of problems with extremely large expansionary deformation. Numerical experiments show that the method is highly efficient in the computation of cavitation problems. Numerical experiments are also conducted on discrete problems without the radial symmetry to show the validity of the method to more general settings and the potential of its application to the study of mechanism of cavity nucleation in nonlinear elastic materials.     

A normal compliance contact problem in viscoelasticity: An a posteriori error analysis and computational experiments

In this work, the numerical approximation of a viscoelastic contact problem is studied. The classical Kelvin-Voigt constitutive law is employed, and contact is assumed with a deformable obstacle and modelled using the normal compliance condition. The variational formulation leads to a nonlinear parabolic variational equation. An existence and uniqueness result is recalled. Then, a fully discrete scheme is introduced, by using the finite element method to approximate the spatial variable and the implicit Euler scheme to discretize time derivatives. A priori error estimates recently proved for this problem are recalled. Then, an a posteriori error analysis is provided, extending some preliminary results obtained in the study of the heat equation and other parabolic equations. Upper and lower error bounds are proved. Finally, some numerical experiments are presented to demonstrate the accuracy and the numerical behaviour of the error estimates.     

A priori and a posteriori error analyses in the study of viscoelastic problems

In this work, the numerical approximation of a viscoelastic problem is studied. A fully discrete scheme is introduced by using the finite element method to approximate the spatial variable and an Euler scheme to discretize time derivatives. Then, two numerical analyses are presented. First, a priori estimates are proved from which the linear convergence of the algorithm is derived under suitable regularity conditions. Secondly, an a posteriori error analysis is provided extending some preliminary results obtained in the study of the heat equation. Upper and lower error bounds are obtained.     

Weighted iterative solutions of linear differential equations and heat conduction of ideal gases in moment theory

An iterative method is proposed to find a particular solution of a system of linear differential equations, in the form of a fixed-point problem, with no boundary conditions. To circumvent the unboundedness of differential operators, iterative approximation with gradually decreasing weight is used. Conditions for convergence that can easily be checked in numerical iterations are established. Furthermore, for the numerical iterative scheme, uniqueness and stability theorems are proved. These results are applied to heat conduction of ideal gases in moment theory.     

NUMERICAL ANALYSIS OF A CONTACT PROBLEM IN RATE-TYPE VISCOPLASTICITY

In this paper, we consider numerical approximations of a contact problem in rate-type viscoplasticity. The contact conditions are described in term of a subdifferential and include as special cases some classical frictionless boundary conditions. The contact problem consists of an evolution equation coupled with a time-dependent variational inequality. Error estimates for both spatially semi-discrete and fully discrete solutions are derived and some convergence results are shown. Under appropriate regularity assumptions on the exact solution, error estimates are obtained.     

Time-harmonic solution for acousto-elastic interaction with controllability and spectral elements

The classical way of solving the time-harmonic linear acousto-elastic wave problem is to discretize the equations with finite elements or finite differences. This approach leads to large-scale indefinite complex-valued linear systems. For these kinds of systems, it is difficult to construct efficient iterative solution methods. That is why we use an alternative approach and solve the time-harmonic problem by controlling the solution of the corresponding time dependent wave equation.In this paper, we use an unsymmetric formulation, where fluid-structure interaction is modeled as a coupling between pressure and displacement. The coupled problem is discretized in space domain with spectral elements and in time domain with central finite differences. After discretization, exact controllability problem is reformulated as a least-squares problem, which is solved by the conjugate gradient method.     

Iterative solution of a singular convection-diffusion perturbation problem

An iterative domain decomposition method is developed to solve a singular perturbation problem. The problem consists of a convection-diffusion equation with a discontinuous (piecewise-constant) diffusion coefficient, and the problem domain is decomposed into two subdomains, on each of which the coefficient is constant. After showing that the boundary value problem is well posed, we indicate a specific numerical implementation of the iterative technique that combines the finite element method on one subdomain with the method of matched asymptotic expansions on the other subdomain. This procedure extends work by Carlenzoli and Quarteroni, which was originally intended for a boundary layer problem with an outer region and an inner region. Our extension carries over to a problem where the domain consists of the outer and inner boundary layer regions plus a region in which the diffusion coefficient is constant and significant in magnitude. An unexpected benefit of our new implementation is its efficiency, which is due to the fact that at each iteration the problem needs to be solved explicitly only on one subdomain. It is only when the final approximation on the entire domain is desired that the matched asymptotic expansions approximation need be computed on the second subdomain. Two-dimensional convergence results and numerical results illustrating the method for a two-dimensional test problem are given.Received: February 12, 2004     

A scalable TFETI algorithm for two-dimensional multibody contact problems with friction

A Total FETI (TFETI) based domain decomposition algorithm with preconditioning by a natural coarse grid of rigid body motions is adapted to the solution of two-dimensional multibody contact problems of elasticity with the Coulomb friction and proved to be scalable for the Tresca friction. The algorithm finds an approximate solution at the cost asymptotically proportional to the number of variables provided the ratio of the decomposition parameter and the discretization parameter is bounded. The analysis is based on the classical results by Farhat, Mandel, and Roux on scalability of FETI with a natural coarse grid for linear problems and on our development of optimal quadratic programming algorithms for bound and equality constrained problems. The algorithm preserves parallel scalability of the classical FETI method. Both theoretical results and numerical experiments indicate a high efficiency of our algorithm. In addition, its performance is illustrated on analysis of the yielding clamp connection with the Coulomb friction.