Two unconditionally stable and convergent difference schemes with the extrapolation method for the one‐dimensional distributed‐order differential equations

The Grünwald formula is used to solve the one‐dimensional distributed‐order differential equations. Two difference schemes are derived. It is proved that the schemes are unconditionally stable and convergent with the convergence orders and in maximum norm, respectively, where and are step sizes in time, space and distributed order. The extrapolation method is applied to improve the approximate accuracy to the orders and respectively. An illustrative numerical example is given to confirm the theoretical results. © 2015 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 32: 591–615, 2016     

Rapid Solution of Minimal Riesz Energy Problems

In , , we compute the solution to both the unconstrained and constrained Gauss variational problem, considered for the Riesz kernel of order and a pair of compact, disjoint, boundaryless ‐dimensional ‐manifolds , , where , each being charged with Borel measures with the sign prescribed. Such variational problems over a cone of Borel measures can be formulated as minimization problems over the corresponding cone of surface distributions belonging to the Sobolev–Slobodetski space , where and (see Harbrecht et al., Math. Nachr. 287 (2014), 48–69). We thus approximate the sought density by piecewise constant boundary elements and apply the primal‐dual active set strategy to impose the desired inequality constraints. The boundary integral operator which is defined by the Riesz kernel under consideration is efficiently approximated by means of an ‐matrix approximation. This particularly enables the application of a preconditioner for the iterative solution of the first‐order optimality system. Numerical results in are given to demonstrate our approach. © 2016Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 32: 1535–1552, 2016     

Electromagnetic eigenfields in checkerboard patterns

Here are described four solvers for time‐harmonic electromagnetic fields in checkerboard patterns. A pattern is built by four squares with constant permittivity, or . It is enclosed by conducting walls or is a unit cell of a periodic structure. The field is represented in two ways: by , the transverse component of the magnetic induction, and by , the magnetic vector potential in Lorenz gauge. and satisfy Helmholtz equations in each square as well as transmission and boundary conditions (BCs). These governing equations yield eigensolutions and , which are found to be at worst. Variational versions of the governing equations are introduced. The weak formulations for are standard, while those for are new. They imply that the derivative transmission and BCs are satisfied weakly on interfaces between regions with different permittivity. Eigenpairs are computed approximately by spectral element methods. They yield mutually consistent eigenpairs. However, only about half of the eigenpairs () correspond to eigenpairs (). For each set of BCs, the first few eigenfrequencies are given by tables, and some of the eigenfunctions are presented by contour plots. © 2015 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 32: 418–444, 2016     

Finite element approximation of a phase field model arising in nanostructure patterning

We consider a fully practical finite element approximation of the nonlinear parabolic Cahn–Hilliard system subject to an initial condition on the conserved order parameter , and mixed boundary conditions. Here, is the interfacial parameter, is the field strength parameter, is the obstacle potential, is the diffusion coefficient, and denotes differentiation with respect to the second argument. Furthermore, w is the chemical potential and is the electrostatic potential. The system, in the context of nanostructure patterning, has been proposed to model the manipulation of morphologies in organic solar cells with the help of an applied electric field. In the limit , it reduces to a sharp interface problem that models the evolution of an unstable interface between two dielectric media in the presence of a quasistatic electric field. On introducing a finite element approximation for the above Cahn–Hilliard system, we prove existence and stability of a discrete solution. Moreover, in the case of two space dimensions, we are able to prove convergence and hence existence of a solution to the considered system of partial differential equations. We demonstrate the practicality of our finite element approximation with several numerical simulations in two and three space dimensions. © 2015 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 31: 1890–1924, 2015     

On a nonoverlapping additive Schwarz method for h‐p discontinuous Galerkin discretization of elliptic problems

The condition number of a discontinuous Galerkin finite element discretization preconditioned with a nonoverlapping additive Schwarz method is analyzed. We improve the result of Antonietti and Houston (J Sci Comput 46 (2011), 124–149), where a bound has been proved for a two‐level nonoverlapping additive Schwarz method with coarse problem using polynomials of degree on a coarse mesh size . In a more general framework, where the concurrency of the algorithm is increased by applying solvers on subdomains smaller than the coarse grid cells, we prove that the condition number of the preconditioned system is where is the coarse space element degree polynomial and is the size of subdomain where local problems are solved in parallel. Our result also extends to the case of discontinuous coefficient, piecewise constant on the coarse grid, for a composite continuous–discontinuous Galerkin discretization. © 2016Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 32: 1572–1590, 2016     

The time discretization in classes of integro‐differential equations with completely monotonic kernels: Weighted asymptotic convergence

We consider the time discretization for the solution of the equation with . Here, the operators L_j are densely defined positive self‐adjoint linear operator on a Hilbert space H and have spectral decompositions with respect to a common resolution of the identity in H . The kernel functions , are assumed to be completely monotonic on (0,∞) and locally integrable, but not constant. The considered time discretization method comes from [Da Xu, Science China Mathematics 56 (2013), 395–424], where the backward Euler method is combined with order one convolution quadrature for approximating the integral term. In this article, the convergence properties of the time discretization are given in the weighted and norm, where ρ is a given weighted function. Numerical experiments show the theoretical results. © 2015 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 32: 896–935, 2016     

Semiframes with Block Size Three and Odd Group Size

A ‐semiframe of type is a ‐GDD of type , , in which the collection of blocks can be written as a disjoint union where is partitioned into parallel classes of and is partitioned into holey parallel classes, each holey parallel class being a partition of for some . A ‐SF is a ‐semiframe of type in which there are p parallel classes in and d holey parallel classes with respect to . In this paper, we shall show that there exists a (3, 1)‐SF for any if and only if , , , and .     

Least‐squares spectral method for velocity‐vorticity‐pressure form of the Stokes equations

The aim of this article is to present and analyze first‐order system least‐squares spectral method for the Stokes equations in two‐dimensional spaces. The Stokes equations are transformed into a first‐order system of equations by introducing vorticity as a new variable. The least‐squares functional is then defined by summing up the ‐ and ‐norms of the residual equations. The ‐norm in the least‐squares functional is replaced by suitable operator. Continuous and discrete homogeneous least‐squares functionals are shown to be equivalent to ‐norm of velocity and ‐norm of vorticity and pressure for spectral Galerkin and pseudospectral method. The spectral convergence of the proposed methods are given and the theory is validated by numerical experiment. Mass conservation is also briefly investigated. © 2015 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 32: 661–680, 2016     

Numerical solution of one‐dimensional Burgers' equation

In this article, an iterative method for the approximate solution of a class of Burgers' equation is obtained in reproducing kernel space . It is proved the approximation converges uniformly to the exact solution u(x, t) for any initial function under trivial conditions, the derivatives of are also convergent to the derivatives of u(x, t), and the approximate solution is the best approximation under the system © 2014 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 31: 1251–1264, 2015     

On Martin's Axiom and Forms of Choice

Martin's Axiom is the statement that for every well‐ordered cardinal , the statement holds, where is “if is a c.c.c. quasi order and is a family of dense sets in P, then there is a ‐generic filter of P”. In , the fragment is provable, but not in general in . In this paper, we investigate the interrelation between and various choice principles. In the choiceless context, it makes sense to drop the requirement that the cardinal κ be well‐ordered, and we can define for any (not necessarily well‐ordered) cardinal the statement to be “if is a c.c.c. quasi order with , and is a family of dense sets in P, then there is a ‐generic filter of P”. We then define to be the statement that for every (not necessarily well‐ordered) cardinal , we have that holds. We then investigate the set‐theoretic strength of the principle .     

Circular symmetrization,subordination and arclength problems on convex functions

We study the class of univalent analytic functions f in the unit disk of the form satisfying where Ω will be a proper subdomain of which is starlike with respect to . Let be the unique conformal mapping of onto Ω with and and . Let denote the arclength of the image of the circle , . The first result in this paper is an inequality for , which solves the general extremal problem , and contains many other well‐known results of the previous authors as special cases. Other results of this article cover another set of related problems about integral means in the general setting of the class .     

Weak Musielak–Orlicz Hardy spaces and applications

Let satisfy that , for any given , is an Orlicz function and is a Muckenhoupt weight uniformly in . In this article, the authors introduce the weak Musielak–Orlicz Hardy space via the grand maximal function and then obtain its vertical or its non–tangential maximal function characterizations. The authors also establish other real‐variable characterizations of , respectively, in terms of the atom, the molecule, the Lusin area function, the Littlewood–Paley g‐function or ‐function. All these characterizations for weighted weak Hardy spaces (namely, and with and ) are new and part of these characterizations even for weak Hardy spaces (namely, and with ) are also new. As an application, the boundedness of Calderón–Zygmund operators from to in the critical case is presented.     

On index theory for non‐Fredholm operators: A (1 + 1)‐dimensional example

Using the general formalism of 12 , a study of index theory for non‐Fredholm operators was initiated in 9 . Natural examples arise from (1 + 1)‐dimensional differential operators using the model operator in of the type , where , and the family of self‐adjoint operators in studied here is explicitly given by Here has to be integrable on and tends to zero as and to 1 as (both functions are subject to additional hypotheses). In particular, , , has asymptotes (in the norm resolvent sense) as , respectively. The interesting feature is that violates the relative trace class condition introduced in 9 , Hypothesis 2.1 ]. A new approach adapted to differential operators of this kind is given here using an approximation technique. The approximants do fit the framework of 9 enabling the following results to be obtained. Introducing , , we recall that the resolvent regularized Witten index of , denoted by , is defined by whenever this limit exists. In the concrete example at hand, we prove Here denotes the spectral shift operator for the pair of self‐adjoint operators , and we employ the normalization, , .     

Clairvoyant embedding in one dimension

Let v, w be infinite 0‐1 sequences, and a positive integer. We say that is ‐embeddable in , if there exists an increasing sequence of integers with , such that , for all . Let and be coin‐tossing sequences. We will show that there is an with the property that is ‐embeddable into with positive probability. This answers a question that was open for a while. The proof generalizes somewhat the hierarchical method of an earlier paper of the author on dependent percolation. © 2014 Wiley Periodicals, Inc. Random Struct. Alg., 47, 520–560, 2015     

On the set‐theoretic strength of the existence of disjoint cofinal sets in posets without maximal elements

In set theory without the Axiom of Choice , we study the deductive strength of the statements (“Every partially ordered set without a maximal element has two disjoint cofinal subsets”), (“Every partially ordered set without a maximal element has a countably infinite disjoint family of cofinal subsets”), (“Every linearly ordered set without a maximum element has two disjoint cofinal subsets”), and (“Every linearly ordered set without a maximum element has a countably infinite disjoint family of cofinal subsets”). Among various results, we prove that none of the above statements is provable without using some form of choice, is equivalent to , + (Dependent Choices) implies , does not imply in (Zermelo‐Fraenkel set theory with the Axiom of Extensionality modified in order to allow the existence of atoms), does not imply in (Zermelo‐Fraenkel set theory minus ) and (hence, ) is strictly weaker than in .     

The threshold for combs in random graphs

For let denote the tree consisting of an ‐vertex path with disjoint ‐vertex paths beginning at each of its vertices. An old conjecture says that for any the threshold for the random graph to contain is at . Here we verify this for with any fixed . In a companion paper, using very different methods, we treat the complementary range, proving the conjecture for (with ). © 2015 Wiley Periodicals, Inc. Random Struct. Alg., 48, 794–802, 2016     

Positive solutions of nonlinear Schrödinger equation with peaks on a Clifford torus

We prove the existence of large energy positive solutions for a stationary nonlinear Schrödinger equation with peaks on a Clifford type torus. Here where with for all Each is a function and is defined by the generalized notion of spherical coordinates. The solutions are obtained by a or a process.     

Improper Coloring of Sparse Graphs with a Given Girth,II: Constructions

A graph G is ‐colorable if can be partitioned into two sets and so that the maximum degree of is at most j and of is at most k. While the problem of verifying whether a graph is (0, 0)‐colorable is easy, the similar problem with in place of (0, 0) is NP‐complete for all nonnegative j and k with . Let denote the supremum of all x such that for some constant every graph G with girth g and for every is ‐colorable. It was proved recently that . In a companion paper, we find the exact value . In this article, we show that increasing g from 5 further on does not increase much. Our constructions show that for every g, . We also find exact values of for all g and all .     

The Large‐Time Solution of Burgers' Equation with Time‐Dependent Coefficients. I. The Coefficients Are Exponential Functions

In this paper, we consider an initial‐value problem for Burgers' equation with variable coefficients where x and t represent dimensionless distance and time, respectively, and , are given functions of t. In particular, we consider the case when the initial data have algebraic decay as , with as and as . The constant states and are problem parameters. Two specific initial‐value problems are considered. In initial‐value problem 1 we consider the case when and , while in initial‐value problem 2 we consider the case when and . The method of matched asymptotic coordinate expansions is used to obtain the large‐t asymptotic structure of the solution to both initial‐value problems over all parameter values.