An adaptive <Emphasis Type="Italic">C</Emphasis><Superscript>0</Superscript>IPG method for the Helmholtz transmission eigenvalue problem

The interior penalty methods using C⁰ Lagrange elements (C⁰IPG) developed in the recent decade for the fourth order problems are an interesting topic in academia at present. In this paper, we discuss the adaptive fashion of C⁰IPG method for the Helmholtz transmission eigenvalue problem. We give the a posteriori error indicators for primal and dual eigenfunctions, and prove their reliability and efficiency. We also give the a posteriori error indicator for eigenvalues and design a C⁰IPG adaptive algorithm. Numerical experiments show that this algorithm is efficient and can get the optimal convergence rate.     

Sharp asymptotics of the <Emphasis Type="Italic">L</Emphasis><Subscript><Emphasis Type="Italic">p</Emphasis></Subscript> approximation error for interpolation on block partitions

Adaptive approximation (or interpolation) takes into account local variations in the behavior of the given function, adjusts the approximant depending on it, and hence yields the smaller error of approximation. The question of constructing optimal approximating spline for each function proved to be very hard. In fact, no polynomial time algorithm of adaptive spline approximation can be designed and no exact formula for the optimal error of approximation can be given. Therefore, the next natural question would be to study the asymptotic behavior of the error and construct asymptotically optimal sequences of partitions. In this paper we provide sharp asymptotic estimates for the error of interpolation by splines on block partitions in \mathbbR^d{\mathbb{R}^d} . We consider various projection operators to define the interpolant and provide the analysis of the exact constant in the asymptotics as well as its explicit form in certain cases.     

Exact order of relative widths of classes <Emphasis Type="Italic">W</Emphasis><Stack><Subscript>1</Subscript><Superscript>r</Superscript></Stack> in the space <Emphasis Type="Italic">L</Emphasis><Subscript>1</Subscript>

We determine the exact order of relative widths of classes W ₁ ^r of periodic functions in the space L ₁ as n → ∞ under restrictions on higher derivatives of approximating functions. __________ Translated from Ukrains’kyi Matematychnyi Zhurnal, Vol. 57, No. 10, pp. 1409–1417, October, 2005.     

Economic design of an adaptive <Emphasis Type="Italic">T</Emphasis><Superscript>2</Superscript> control chart

Varying three parameters of the Hotelling's T² control chart, namely, the sample size, the sampling interval length, and the action limit, results in a great improvement over the traditional T² control chart particularly for the small process shift. This paper presents the economic model for designing the variable parameters T² chart. In the economic design, a cost function is constructed, involving the cost of sampling and testing, the cost of false alarm, the cost to detect and remove the assignable cause, and the cost when the process is operating out-of-control. Also, a heuristic method of finding optimal values of adaptive design parameters for minimizing the cost function is presented. Variable and fixed parameters T² control charts are compared with respect to the expected loss per unit time. Furthermore, the effects of the initial sample number (used for estimating the parameters of F-distribution) upon the operating cost and adaptive design parameters are examined.     

Homogenization of the parabolic cauchy problem in the Sobolev class H<Superscript>1</Superscript>(R<Superscript>d</Superscript>)

Homogenization in the small period limit for the solution ue of the Cauchy problem for a parabolic equation in R^d is studied. The coefficients are assumed to be periodic in R^d with respect to the lattice ɛG. As ɛ → 0, the solution u ɛ converges in L2(R^d) to the solution u0 of the effective problem with constant coefficients. The solution u ɛis approximated in the norm of the Sobolev space H ¹(R^d) with error O( ɛ); this approximation is uniform with respect to the L2-norm of the initial data and contains a corrector term of order ɛ. The dependence of the constant in the error estimate on time t is given. Also, an approximation in H ¹(R^d) for the solution of the Cauchy problem for a nonhomogeneous parabolic equation is obtained.     

Matrix decomposition algorithms for the <Emphasis Type="Italic">C</Emphasis><Superscript>0</Superscript>-quadratic finite element Galerkin method

Explicit expressions for the eigensystems of one-dimensional finite element Galerkin (FEG) matrices based on C ⁰ piecewise quadratic polynomials are determined. These eigensystems are then used in the formulation of fast direct methods, matrix decomposition algorithms (MDAs), for the solution of the FEG equations arising from the discretization of Poisson’s equation on the unit square subject to several standard boundary conditions. The MDAs employ fast Fourier transforms and require O(N ²log N) operations on an N×N uniform partition. Numerical results are presented to demonstrate the efficacy of these algorithms.     

On meromorphic solutions of <Emphasis Type="Italic">f</Emphasis><Superscript>2</Superscript> + <Emphasis Type="Italic">g</Emphasis><Superscript>2</Superscript> = 1

We show that meromorphic solutions f, g of f ² + g ² = 1 in C² must be constant, if f _z2 and g _z1 have the same zeros (counting multiplicities). We also apply the result to characterize meromorphic solutions of certain nonlinear partial differential equations.     

An adaptive finite element method for a time‐dependent Stokes problem

In this article, we conduct an a posteriori error analysis of the two‐dimensional time‐dependent Stokes problem with homogeneous Dirichlet boundary conditions, which can be extended to mixed boundary conditions. We present a full time–space discretization using the discontinuous Galerkin method with polynomials of any degree in time and the ? ₂ ? ?₁ Taylor–Hood finite elements in space, and propose an a posteriori residual‐type error estimator. The upper bounds involve residuals, which are global in space and local in time, and an L ²‐error term evaluated on the left‐end point of time step. From the error estimate, we compute local error indicators to develop an adaptive space/time mesh refinement strategy. Numerical experiments verify our theoretical results and the proposed adaptive strategy.     

<Emphasis Type="Italic">L</Emphasis><Superscript>2</Superscript>-error estimates for Dirichlet and Neumann problems on anisotropic finite element meshes

An L ²-estimate of the finite element error is proved for a Dirichlet and a Neumann boundary value problem on a three-dimensional, prismatic and non-convex domain that is discretized by an anisotropic tetrahedral mesh. To this end, an approximation error estimate for an interpolation operator that is preserving the Dirichlet boundary conditions is given. The challenge for the Neumann problem is the proof of a local interpolation error estimate for functions from a weighted Sobolev space.     

On Conditions for <Emphasis Type="Italic">L</Emphasis><Superscript>2</Superscript>-Dissipativity of Linearized Explicit QGD Finite-Difference Schemes for One-Dimensional Gas Dynamics Equations

An explicit two-level in time and spatially symmetric finite-difference scheme approximating the 1D quasi-gasdynamic system of equations is studied. The scheme is linearized about a constant solution, and new necessary and sufficient conditions for the L²-dissipativity of solutions to the Cauchy problem are derived, including, for the first time, the case of a nonzero background velocity and depending on the Mach number. It is shown that the condition on the Courant number can be made independent of the Mach number. The results provide a substantial development of the well-known stability analysis of the linearized Lax–Wendroff scheme.     

Adaptive multilevel finite element approximations of semilinear elliptic boundary value problems

Summary. In this paper we consider two aspects of the problem of designing efficient numerical methods for the approximation of semilinear boundary value problems. First we consider the use of two and multilevel algorithms for approximating the discrete solution. Secondly we consider adaptive mesh refinement based on feedback information from coarse level approximations. The algorithms are based on an a posteriori error estimate, where the error is estimated in terms of computable quantities only. The a posteriori error estimate is used for choosing appropriate spaces in the multilevel algorithms, mesh refinements, as a stopping criterion and finally it gives an estimate of the total error. Received April 8, 1997 / Revised version received July 27, 1998 / Published online September 24, 1999     

An adaptive C~0IPG method for the Helmholtz transmission eigenvalue problem

The interior penalty methods using C~0 Lagrange elements(C~0 IPG) developed in the recent decade for the fourth order problems are an interesting topic at present. In this paper, we discuss the adaptive proporty of C~0 IPG method for the Helmholtz transmission eigenvalue problem. We give the a posteriori error indicators for primal and dual eigenfunctions, and prove their reliability and efficiency. We also give the a posteriori error indicator for eigenvalues and design a C~0 IPG adaptive algorithm. Numerical experiments show that this algorithm is efficient and can get the optimal convergence rate.     

Theta functions on <Emphasis Type="Italic">T</Emphasis><Superscript>2</Superscript>-bundles over <Emphasis Type="Italic">T</Emphasis><Superscript>2</Superscript> with the zero Euler class

We construct an analog of the classical theta function on an abelian variety for the closed 4-dimensional symplectic manifolds that are T ²-bundles over T ² with the zero Euler class. We use our theta functions for a canonical symplectic embedding of these manifolds into complex projective spaces (an analog of the Lefschetz theorem).     

S<Superscript>1</Superscript>-Valued Sobolev maps

We describe the structure of the space W^s,p( \mathbbSⁿ;\mathbbS¹ ) {W^{s,p}}\left( {{\mathbb{S}^n};{\mathbb{S}^1}} \right) , where 0 < s < ∞ and 1 ≤ p < ∞. According to the values of s, p, and n, maps in W^s,p( \mathbbSⁿ;\mathbbS¹ ) {W^{s,p}}\left( {{\mathbb{S}^n};{\mathbb{S}^1}} \right) can either be characterised by their phases or by a couple (singular set, phase).     

Low cost a posteriori error estimators for an augmented mixed FEM in linear elasticity

We consider an augmented mixed finite element method applied to the linear elasticity problem and derive a posteriori error estimators that are simpler and easier to implement than the ones available in the literature. In the case of homogeneous Dirichlet boundary conditions, the new a posteriori error estimator is reliable and locally efficient, whereas for non-homogeneous Dirichlet boundary conditions, we derive an a posteriori error estimator that is reliable and satisfies a quasi-efficiency bound. Numerical experiments illustrate the performance of the corresponding adaptive algorithms and support the theoretical results.     

Universally <Emphasis Type="Italic">L</Emphasis><Superscript>1</Superscript>-bad arithmetic sequences

We present a modified version of Buczolich and Mauldin’s proof that the sequence of square numbers is universally L ¹-bad. We extend this result to a large class of sequences, including the dth powers and the set of primes. Furthermore, we show that any subsequence of the averages taken along these sequences is also universally L ¹-bad.     

Topological hypercovers and <Superscript>1</Superscript>-realizations

We show that if U_* is a hypercover of a topological space X then the natural map hocolim U_* X is a weak equivalence. This fact is used to construct topological realization functors for the ¹-homotopy theory of schemes over real and complex fields. In an appendix, we also prove a theorem about computing homotopy colimits of spaces that are not cofibrant.Mathematics Subject Classification (2000):55U35, 14F20, 14F42The second author was supported by an NSF Postdoctoral Research Fellowship     

A pair of disjoint 3-GDDs of type <Emphasis Type="Italic">g</Emphasis><Superscript><Emphasis Type="Italic">t</Emphasis></Superscript><Emphasis Type="Italic">u</Emphasis><Superscript>1</Superscript>

Pairwise disjoint 3-GDDs can be used to construct some optimal constant-weight codes. We study the existence of a pair of disjoint 3-GDDs of type g ^t u ¹ and establish that its necessary conditions are also sufficient.     

A posteriori error estimates of edge residual type of finite element method for nonmonotone quasi‐linear elliptic problems

In this article, we study the edge residual‐based a posteriori error estimates of conforming linear finite element method for nonmonotone quasi‐linear elliptic problems. It is proven that edge residuals dominate a posteriori error estimates. Up to higher order perturbations, edge residuals can act as a posteriori error estimators. The global reliability and local efficiency bounds are established both in H ¹‐norm and L ²‐norm. Numerical experiments are provided to illustrate the performance of the proposed error estimators. © 2013 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 30: 813–837, 2014