A closed-form multigrid smoothing factor for an additive Vanka-type smoother applied to the Poisson equation

We consider an additive Vanka-type smoother for the Poisson equation discretized by the standard finite difference centered scheme. Using local Fourier analysis, we derive analytical formulas for the optimal smoothing factors for vertex-wise and element-wise Vanka smoothers. In one dimension the element-wise Vanka smoother is equivalent to the scaled mass operator obtained from the linear finite element method and in two dimensions the element-wise Vanka smoother is equivalent to the scaled mass operator discretized by bilinear finite element method plus a scaled identity operator. Based on these findings, the mass matrix obtained from finite element method can be used as a smoother for the Poisson equation, and the resulting mass-based relaxation scheme yields small smoothing factors in one, two, and three dimensions, while avoiding the need to compute an inverse of a matrix. Our analysis may help better understand the smoothing properties of additive Vanka approaches and develop fast solvers for numerical solutions of other partial differential equations.     

Hyperbolic smoothing function method for minimax problems

In this article, an approach for solving finite minimax problems is proposed. This approach is based on the use of hyperbolic smoothing functions. In order to apply the hyperbolic smoothing we reformulate the objective function in the minimax problem and study the relationship between the original minimax and reformulated problems. We also study main properties of the hyperbolic smoothing function. Based on these results an algorithm for solving the finite minimax problem is proposed and this algorithm is implemented in general algebraic modelling system. We present preliminary results of numerical experiments with well-known nonsmooth optimization test problems. We also compare the proposed algorithm with the algorithm that uses the exponential smoothing function as well as with the algorithm based on nonlinear programming reformulation of the finite minimax problem.     

A Finite Smoothing Algorithm for Quantile Regression

This article introduces a new method for computing regression quantile functions. This method applies a finite smoothing algorithm based on smoothing the nondifferentiable quantile regression objective function ρ_τ. The smoothing can be done for all τ ∈ (0, 1), and the convergence is finite for any finite number of τ_i ∈ (0, 1), i = 1,…,N. Numerical comparison shows that the finite smoothing algorithm outperforms the simplex algorithm in computing speed. Compared with the powerful interior point algorithm, which was introduced in an earlier article, it is competitive overall; however, it is significantly faster than the interior point algorithm when the design matrix in quantile regression has a large number of covariates. Additionally, the new algorithm provides the same accuracy as the simplex algorithm. In contrast, the interior point algorithm gives only the approximate solutions in theory, and rounding may be necessary to improve the accuracy of these solutions in practice.     

半导体器件瞬态模拟的对称正定混合元方法

提出具有对称正定特性的混合元格式求解非稳态半导体器件瞬态模拟问题。提出一个最小二乘混合元方法、一个新的具有分裂和对称正定性质的混合元格式和一个解经典混合元方程的对称正定失窃工格式求解电场位势和电场强度方程;提出一个最小二乘混合元格式求解关于电子与空穴浓度的非稳态对流扩散方程,浓度函数和流函数被同时求解;采用标准的有限元方法求解热传导方程。建立了误差分析理论。     

On the numerical approximation of unstable minimal surfaces with polygonal boundaries

Summary. This work is concerned with the approximation and the numerical computation of polygonal minimal surfaces in . Polygonal minimal surfaces correspond to the critical points of Shiffman's function . Since this function is analytic, polygonal minimal surfaces can be characterized by means of the second derivative of . We present a finite element approximation of quasiminimal surfaces together with an error estimate. In this way we obtain discrete approximations of and of . In particular we prove that the discrete functions converge uniformly on certain compact subsets. This will be the main tool for proving existence and convergence of discrete minimal surfaces in neighbourhoods of non-degenerate minimal surfaces. In the numerical part of this paper we compute numerical approximations of polygonal minimal surfaces by use of Newton's method applied to . Received October 27, 1994     

Multiscale methods for elliptic homogenization problems

In this article we study two families of multiscale methods for numerically solving elliptic homogenization problems. The recently developed multiscale finite element method [Hou and Wu, J Comp Phys 134 (1997), 169–189] captures the effect of microscales on macroscales through modification of finite element basis functions. Here we reformulate this method that captures the same effect through modification of bilinear forms in the finite element formulation. This new formulation is a general approach that can handle a large variety of differential problems and numerical methods. It can be easily extended to nonlinear problems and mixed finite element methods, for example. The latter extension is carried out in this article. The recently introduced heterogeneous multiscale method [Engquist and Engquist, Comm Math Sci 1 (2003), 87–132] is designed for efficient numerical solution of problems with multiscales and multiphysics. In the second part of this article, we study this method in mixed form (we call it the mixed heterogeneous multiscale method). We present a detailed analysis for stability and convergence of this new method. Estimates are obtained for the error between the homogenized and numerical multiscale solutions. Strategies for retrieving the microstructural information from the numerical solution are provided and analyzed. Relationship between the multiscale finite element and heterogeneous multiscale methods is discussed. © 2005 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2006     

A new family of high regularity elements

In this article, we propose a new family of high regularity finite element spaces. The global approximation spaces are obtained in two steps. We first build an open cover of the computational domain and local approximation spaces on each patch of the cover. Then we construct partition of unity functions subordinate to the open cover depending on the regularity requirement. The basis functions of the global space is given by the products of the local basis functions and the corresponding partition of unity functions. The method can be used to construct finite element spaces of any desired regularity. Approximation properties and implementation details are discussed. Numerical examples for the biharmonic equation are presented to show the effectiveness of the proposed method. © 2010 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 28: 1–16, 2012     

Finite-element solution of a model mechanical problem with friction based on a smoothing Lagrange multiplier method

The convergence of the finite element method in a stable smoothing algorithm for solving a model problem with given friction based on an iterative proximal regularization of the modified Lagrangian functional is analyzed. Numerical results are presented.     

Optimal adaptive grids of least-squares finite element methods in two spatial dimensions

This article concerns a procedure to generate optimal adaptive grids for convection dominated problems in two spatial dimensions based on least-squares finite element approximations. The procedure extends a one dimensional equidistribution principle which minimizes the interpolation error in some norms. The idea is to select two directions which can reflect the physics of the problems and then apply the one dimensional equidistribution principle to the chosen directions. Model problems considered are the two dimensional convection-diffusion problems where boundary and interior layers occur. Numerical results of model problems illustrating the efficiency of the proposed scheme are presented. In addition, to avoid skewed mesh in the optimal grids generated by the algorithm, an unstructured local mesh smoothing will be considered in the least-squares approximations. Comparisons with the Gakerkin finite element method will also be provided.     

A smoothing Levenberg-Marquardt method for nonlinear complementarity problems

As is well-known, Jacobian smoothing method is a popular one to solve nonlinear complementarity problems, in which the Jacobian consistency is stressed. By investigating an element of related functions’ B-differential, a smoothing Levenberg-Marquardt(LM) method is proposed based on a Chen-Harker-Kanzow-Smale(CHKS) smoothing function, which satisfies a property called strongly Jacobian consistency. Finally, the numerical experiments illustrate the effectiveness of the given method.     

An accurate a posteriori error estimator for the Steklov eigenvalue problem and its applications

In this paper, a type of accurate a posteriori error estimator is proposed for the Steklov eigenvalue problem based on the complementary approach, which provides an asymptotic exact estimate for the approximate eigenpair. Besides, we design a type of cascadic adaptive finite element method for the Steklov eigenvalue problem based on the proposed a posteriori error estimator. In this new cascadic adaptive scheme, instead of solving the Steklov eigenvalue problem in each adaptive space directly, we only need to do some smoothing steps for linearized boundary value problems on a series of adaptive spaces and solve some Steklov eigenvalue problems on a low dimensional space. Furthermore, the proposed a posteriori error estimator provides the way to refine mesh and control the number of smoothing steps for the cascadic adaptive method. Some numerical examples are presented to validate the efficiency of the algorithm in this paper.

     

Steklov eigenvalue problem and its applications An accurate a posteriori error estimator for the

In this paper, a type of accurate a posteriori error estimator is proposed for the Steklov eigenvalue problem based on the complementary approach, which provides an asymptotic exact estimate for the approximate eigenpair. Besides, we design a type of cascadic adaptive finite element method for the Steklov eigenvalue problem based on the proposed a posteriori error estimator. In this new cascadic adaptive scheme, instead of solving the Steklov eigenvalue problem in each adaptive space directly, we only need to do some smoothing steps for linearized boundary value problems on a series of adaptive spaces and solve some Steklov eigenvalue problems on a low dimensional space. Furthermore, the proposed a posteriori error estimator provides the way to refine meshes and control the number of smoothing steps for the cascadic adaptive method. Some numerical examples are presented to validate the efficiency of the algorithm in this paper.     

Analysis of optimal preconditioners for CutFEM

In this article, we consider a class of unfitted finite element methods for scalar elliptic problems. These so-called CutFEM methods use standard finite element spaces on a fixed unfitted triangulation combined with the Nitsche technique and a ghost penalty stabilization. As a model problem we consider the application of such a method to the Poisson interface problem. We introduce and analyze a new class of preconditioners that is based on a subspace decomposition approach. The unfitted finite element space is split into two subspaces, where one subspace is the standard finite element space associated to the background mesh and the second subspace is spanned by all cut basis functions corresponding to nodes on the cut elements. We will show that this splitting is stable, uniformly in the discretization parameter and in the location of the interface in the triangulation. Based on this we introduce an efficient preconditioner that is uniformly spectrally equivalent to the stiffness matrix. Using a similar splitting, it is shown that the same preconditioning approach can also be applied to a fictitious domain CutFEM discretization of the Poisson equation. Results of numerical experiments are included that illustrate optimality of such preconditioners for the Poisson interface problem and the Poisson fictitious domain problem.     

Mixed Discontinuous Galerkin Time-Stepping Method for Linear Parabolic Optimal Control Problems

In this paper, we discuss the mixed discontinuous Galerkin (DG) finite element approximation to linear parabolic optimal control problems. For the state variables and the co-state variables, the discontinuous finite element method is used for the time discretization and the Raviart-Thomas mixed finite element method is used for the space discretization. We do not discretize the space of admissible control but implicitly utilize the relation between co-state and control for the discretization of the control. We derive a priori error estimates for the lowest order mixed DG finite element approximation. Moveover, for the element of arbitrary order in space and time, we derive a posteriori $L^2(0, T ;L^2(Ω))$ error estimates for the scalar functions, assuming that only the underlying mesh is static. Finally, we present an example to confirm the theoretical result on a priori error estimates.     

Varying-coefficient model for the occurrence rate function of recurrent events

This article mainly considers the recurrent event process with independent censoring mechanism through a more flexible varying-coefficient model. The smoothing estimators for the varying-coefficient functions are also proposed via maximizing the kernel weight version of the log-partial likelihood function with respect to the coefficients at each time point. For the selection of appropriate bandwidths and the construction of confidence intervals, the consistent empirical smoothing estimators for the covariance functions of the estimators and a bias correction method are considered. As for the baseline effect function of recurrent events in the population, two different smoothing estimation methods are suggested and investigated. In this study, the asymptotic properties of the proposed smoothing estimators are derived. The finite sample properties of our methods are examined through a Monte Carlo simulation. Moreover, the procedures are applied to a recurrent sample of AIDS link to intravenous experiences (ALIVE) cohort study.     

Generalizations of the Finite Element Method

This paper is concerned with the generalization of the finite element method via the use of non-polynomial enrichment functions. Several methods employ this general approach, e.g. the extended finite element method and the generalized finite element method. We review these approaches and interpret them in the more general framework of the partition of unity method. Here we focus on fundamental construction principles, approximation properties and stability of the respective numerical method. To this end, we consider meshbased and meshfree generalizations of the finite element method and the use of smooth, discontinuous, singular and numerical enrichment functions.     

A derivative-free algorithm for systems of nonlinear inequalities

Recently a new derivative-free algorithm has been proposed for the solution of linearly constrained finite minimax problems. This derivative-free algorithm is based on a smoothing technique that allows one to take into account the non-smoothness of the max function. In this paper, we investigate, both from a theoretical and computational point of view, the behavior of the minmax algorithm when used to solve systems of nonlinear inequalities when derivatives are unavailable. In particular, we show an interesting property of the algorithm, namely, under some mild conditions regarding the regularity of the functions defining the system, it is possible to prove that the algorithm locates a solution of the problem after a finite number of iterations. Furthermore, under a weaker regularity condition, it is possible to show that an accumulation point of the sequence generated by the algorithm exists which is a solution of the system. Moreover, we carried out numerical experimentation and comparison of the method against a standard pattern search minimization method. The obtained results confirm that the good theoretical properties of the method correspond to interesting numerical performance. Moreover, the algorithm compares favorably with a standard derivative-free method, and this seems to indicate that extending the smoothing technique to pattern search algorithms can be beneficial.     

The spaces of meromorphic Prym differentials on a finite Riemann surface

In the previous articles the second author started constructing a general theory of multiplicative functions and Prym differentials on a compact Riemann surface for arbitrary characters. Function theory on compact Riemann surfaces differs substantially from that on finite Riemann surfaces. In this article we start constructing a general function theory on variable finite Riemann surfaces for multiplicative meromorphic functions and differentials. We construct the forms of all elementary Prym differentials for arbitrary characters and find the dimensions of, and also construct explicit bases for, two important quotient spaces of Prym differentials. This yields the dimension of and a basis for the first holomorphic de Rham cohomology group of Prym differentials for arbitrary characters.     

Adaptive finite element approximations on nonmatching grids for second‐order elliptic problems

In this article we consider a finite element approximation for a model elliptic problem of second order on non‐matching grids. This method combines the continuous finite element method with interior penalty discontinuous Galerkin method. As a special case, we develop a finite element method that is continuous on the matching part of the grid and is discontinuous on the nonmatching part. A residual type a posteriori error estimate is derived. Results of numerical experiments are presented. © 2009 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2010     

An adaptive stabilized finite element method for the generalized Stokes problem

In this work we present an adaptive strategy (based on an a posteriori error estimator) for a stabilized finite element method for the Stokes problem, with and without a reaction term. The hierarchical type estimator is based on the solution of local problems posed on appropriate finite dimensional spaces of bubble-like functions. An equivalence result between the norm of the finite element error and the estimator is given, where the dependence of the constants on the physics of the problem is explicited. Several numerical results confirming both the theoretical results and the good performance of the estimator are given.