An additive Schwarz method for a stationary convection-diffusion problem

In this paper, we consider an additive Schwarz method applied to a linear, second order, nonsymmetric, indefinite problem. We discuss the solution of linear system of algebraic equations that arise from the streamline method for the above problem. An alternative linear system, which has the same solution as the system obtained by the streamline method, is derived and the GMRES method is used to solve this system. We show that the rate of convergence does not depend on the mesh size, nor on the number of local problems if the coarse mesh is fine enough.     

A note on the convergence of product integration and Galerkin method for weakly singular integral equations

We consider weakly singular integral equations of Fredholm-type whose kernels satisfy certain algebraic estimates with their derivatives. In particular, we establish optimal convergence order estimates for product integration and Galerkin method applied on suitable grading mesh for the solution of such equations. Some superconvergence results are also derived.     

Multigrid in H (div) and H (curl)

Summary. We consider the solution of systems of linear algebraic equations which arise from the finite element discretization of variational problems posed in the Hilbert spaces and in three dimensions. We show that if appropriate finite element spaces and appropriate additive or multiplicative Schwarz smoothers are used, then the multigrid V-cycle is an efficient solver and preconditioner for the discrete operator. All results are uniform with respect to the mesh size, the number of mesh levels, and weights on the two terms in the inner products. Received June 12, 1998 / Revised version received March 12, 1999 / Published online January 27, 2000     

基于子结构法构造用非协调元解椭圆型问题的预处理器（Ⅰ）

基于子结构法构造用非协调元解椭圆型问题的预处理器（Ⅰ）顾金生，胡显承（清华大学应用数学系）ＴＨＥＣＯＮＳＴＲＵＣＴＩＯＮＯＦＰＲＥＣＯＮＤＩＴＩＯＮＥＲＳＦＯＲＥＬＬＩＰＴＩＣＰＲＯＢＬＥＭＳＤＩＳＣＲＥＴＩＺＥＤＢＹＮＯＮＣＯＮＦＯＲＭＩＮＧＦＩＮ...     

An efficient algebraic multigrid method for quadratic discretizations of linear elasticity problems on some typical anisotropic meshes in three dimensions

The quality of the mesh used in the finite element discretizations will affect the efficiency of solving the discreted linear systems. The usual algebraic solvers except multigrid method do not consider the effect of the grid geometry and the mesh quality on their convergence rates. In this paper, we consider the hierarchical quadratic discretizations of three‐dimensional linear elasticity problems on some anisotropic hexahedral meshes and present a new two‐level method, which is weakly independent of the size of the resulting problems by using a special local block Gauss–Seidel smoother, that is LBGS_v iteration when used for vertex nodes or LBGS_m iteration for midside nodes. Moreover, we obtain the efficient algebraic multigrid (AMG) methods by applying DAMG (AMG based on distance matrix) or DAMG‐PCG (PCG with DAMG as a preconditioner) to the solution of the coarse level equation. The resulting AMG methods are then applied to a practical example as a long beam. The numerical results verify the efficiency and robustness of the proposed AMG algorithms. Copyright © 2015 John Wiley & Sons, Ltd.     

OPTIMAL HARVESTING OF A SPATIALLY EXPLICIT FISHERY MODEL

Abstract We consider an optimal fishery harvesting problem using a spatially explicit model with a semilinear elliptic PDE, Dirichlet boundary conditions, and logistic population growth. We consider two objective functionals: maximizing the yield and minimizing the cost or the variation in the fishing effort (control). Existence, necessary conditions, and uniqueness for the optimal harvesting control for both cases are established. Results for maximizing the yield with Neumann (no‐flux) boundary conditions are also given. The optimal control when minimizing the variation is characterized by a variational inequality instead of the usual algebraic characterization, which involves the solutions of an optimality system of nonlinear elliptic partial differential equations. Numerical examples are given to illustrate the results.     

Computing arbitrary Lagrangian Eulerian maps for evolving surfaces

The good mesh quality of a discretized closed evolving surface is often compromised during time evolution. In recent years this phenomenon has been theoretically addressed in a few ways, one of them uses arbitrary Lagrangian Eulerian (ALE) maps. However, the numerical computation of such maps still remained an unsolved problem in the literature. An approach, using differential algebraic problems, is proposed here to numerically compute an arbitrary Lagrangian Eulerian map, which preserves the mesh properties over time. The ALE velocity is obtained by finding an equilibrium of a simple spring system, based on the connectivity of the nodes in the mesh. We also consider the algorithmic question of constructing acute surface meshes. We present various numerical experiments illustrating the good properties of the obtained meshes and the low computational cost of the proposed approach.     

A robust optimal preconditioner for the mixed finite element discretization of elliptic optimal control problems

In this paper, we consider the efficient solving of the resulting algebraic system for elliptic optimal control problems with mixed finite element discretization. We propose a block‐diagonal preconditioner for the symmetric and indefinite algebraic system solved with minimum residual method, which is proved to be robust and optimal with respect to both the mesh size and the regularization parameter. The block‐diagonal preconditioner is constructed based on an isomorphism between appropriately chosen solution space and its dual for a general control problem with both state and gradient state observations in the objective functional. Numerical experiments confirm the efficiency of our proposed preconditioner.     

Adaptive computation of smallest eigenvalues of self‐adjoint elliptic partial differential equations

We consider a new adaptive finite element (AFEM) algorithm for self‐adjoint elliptic PDE eigenvalue problems. In contrast to other approaches we incorporate the inexact solutions of the resulting finite‐dimensional algebraic eigenvalue problems into the adaptation process. In this way we can balance the costs of the adaptive refinement of the mesh with the costs for the iterative eigenvalue method. We present error estimates that incorporate the discretization errors, approximation errors in the eigenvalue solver and roundoff errors, and use these for the adaptation process. We show that it is also possible to restrict to very few iterations of a Krylov subspace solver for the eigenvalue problem on coarse meshes. Several examples are presented to show that this new approach achieves much better complexity than the previous AFEM approaches which assume that the algebraic eigenvalue problem is solved to full accuracy. Copyright © 2010 John Wiley & Sons, Ltd.     

Construction of locally conservative fluxes for the SUPG method

We consider the construction of locally conservative fluxes by means of a simple postprocessing technique obtained from the finite element solutions of advection diffusion equations. It is known that a naive calculation of fluxes from these solutions yields nonconservative fluxes. We consider two finite element methods: the usual continuous Galerkin finite element method for solving nondominating advection diffusion equations and the streamline upwind/Petrov‐Galerkin method for solving advection dominated problems. We then describe the postprocessing technique for constructing conservative fluxes from the numerical solutions of the general variational formulation. The postprocessing technique requires solving an auxiliary Neumann boundary value problem on each element independently and it produces a locally conservative flux on a vertex centered dual mesh relative to the finite element mesh. We provide a convergence analysis for the postprocessing technique. Performance of the technique and the convergence behavior are demonstrated through numerical examples including a set of test problems for advection diffusion equations, advection dominated equations, and drift‐diffusion equations. © 2015 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 31: 1971–1994, 2015     

Mesh and solver co‐adaptation in finite element methods for anisotropic problems

Mesh generation and algebraic solver are two important aspects of the finite element methodology. In this article, we are concerned with the joint adaptation of the anisotropic triangular mesh and the iterative algebraic solver. Using generic numerical examples pertaining to the accurate and efficient finite element solution of some anisotropic problems, we hereby demonstrate that the processes of geometric mesh adaptation and the algebraic solver construction should be adapted simultaneously. We also propose some techniques applicable to the co‐adaptation of both anisotropic meshes and linear solvers. © 2005 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2005     

A robust structured preconditioner for time-harmonic parabolic optimal control problems

We consider the iterative solution of optimal control problems constrained by the time-harmonic parabolic equations. Due to the time-harmonic property of the control equations, a suitable discretization of the corresponding optimality systems leads to a large complex linear system with special two-by-two block matrix of saddle point form. For this algebraic system, an efficient preconditioner is constructed, which results in a fast Krylov subspace solver, that is robust with respect to the mesh size, frequency, and regularization parameters. Furthermore, the implementation is straightforward and the computational complexity is of optimal order, linear in the number of degrees of freedom. We show that the eigenvalue distribution of the corresponding preconditioned matrix leads to a condition number bounded above by 2. Numerical experiments confirming the theoretical derivations are presented, including comparisons with some other existing preconditioners.     

A mass-conservative control volume-finite element method for solving Richards’ equation in heterogeneous porous media

We present a mass-conservative vertex-centred finite volume method for efficiently solving the mixed form of Richards’ equation in heterogeneous porous media. The spatial discretisation is particularly well-suited to heterogeneous media because it produces consistent flux approximations at quadrature points where material properties are continuous. Combined with the method of lines, the spatial discretisation gives a set of differential algebraic equations amenable to solution using higher-order implicit solvers. We investigate the solution of the mixed form using a Jacobian-free inexact Newton solver, which requires the solution of an extra variable for each node in the mesh compared to the pressure-head form. By exploiting the structure of the Jacobian for the mixed form, the size of the preconditioner is reduced to that for the pressure-head form, and there is minimal computational overhead for solving the mixed form.     

Optimal global approximation of stochastic differential equations with additive Poisson noise

We consider strong global approximation of SDEs driven by a homogeneous Poisson process with intensity λ > 0. We establish the exact convergence rate of minimal errors that can be achieved by arbitrary algorithms based on a finite number of observations of the Poisson process. We consider two classes of methods using equidistant or nonequidistant sampling of the Poisson process, respectively. We provide a construction of optimal schemes, based on the classical Euler scheme, which asymptotically attain the established minimal errors. It turns out that methods based on nonequidistant mesh are more efficient than those based on the equidistant mesh.     

Adaptive Surface Reconstruction Based on Tensor Product Algebraic Splines

Surface reconstruction from unorganized data points is a challenging problem in Computer Aided Design and Geometric Modeling. In this paper, we extend the mathematical model proposed by Juttler and Felis (Adv. Comput. Math., 17 (2002), pp. 135-152) based on tensor product algebraic spline surfaces from fixed meshes to adaptive meshes. We start with a tensor product algebraic B-spline surface defined on an initial mesh to fit the given data based on an optimization approach. By measuring the fitting errors over each cell of the mesh, we recursively insert new knots in cells over which the errors are larger than some given threshold, and construct a new algebraic spline surface to better fit the given data locally. The algorithm terminates when the error over each cell is less than the threshold. We provide some examples to demonstrate our algorithm and compare it with Jiittler's method. Examples suggest that our method is effective and is able to produce reconstruction surfaces of high quality.AMS subject classifications: 65D17     

The Beginnings of the Theory of Hopf Algebras

We consider issues related to the origins, sources and initial motivations of the theory of Hopf algebras. We consider the two main sources of primeval development: algebraic topology and algebraic group theory. Hopf algebras are named from the work of Heinz Hopf in the 1940’s. In this note we trace the infancy of the subject back to papers from the 40’s, 50’s and 60’s in the two areas mentioned above. Many times we just describe—and/or transcribe parts of—some of the relevant original papers on the subject.     

A Rayleigh quotient minimization algorithm based on algebraic multigrid

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.     

Reconstruction of a Variety from the Derived Category and Groups of Autoequivalences

We consider smooth algebraic varieties with ample either canonical or anticanonical sheaf. We prove that such a variety is uniquely determined by its derived category of coherent sheaves. We also calculate the group of exact autoequivalences for these categories. The technics of ample sequences in Abelian categories is used.     

Collocation methods for solving linear differential-algebraic boundary value problems

Summary. We consider boundary value problems for linear differential-algebraic equations with variable coefficients with no restriction on the index. A well-known regularisation procedure yields an equivalent index one problem with d differential and a=n-d algebraic equations. Collocation methods based on the regularised BVP approximate the solution x by a continuous piecewise polynomial of degree k and deliver, in particular, consistent approximations at mesh points by using the Radau schemes. Under weak assumptions, the collocation problems are uniquely and stably solvable and, if the unique solution x is sufficiently smooth, convergence of order min {k+1,2k-1} and superconvergence at mesh points of order 2k-1 is shown. Finally, some numerical experiments illustrating these results are presented. Received October 1, 1999 / Revised version received April 25, 2000 / Published online December 19, 2000     

On a generalization of Pólya’s theorem

We consider generalizations of Pólya’s theorem to the case of entire functions taking algebraic values at natural or integer points.