The characterization of a class of subspace pseudoframes with arbitrary real number translations

In this article, the notion of generalized multiresolution structure is introduced. The concept of subspace pseudoframes with arbitrary real number translations is proposed. A new method for constructing a generalized multiresolution structure in Paley–Wiener subspace of L²(R) is presented. A pyramid decomposition scheme is established based on such a generalized multiresolution structure. Finally, affine frames of space L²(R) with arbitrary real number translations are obtained by virtue of the subspace pseudoframes and the pyramid decomposition scheme. Relation to some physical theories such as quarks confinement is also investigated.     

A finite difference scheme of improved accuracy on a priori adapted grids for a singularly perturbed parabolic convection-diffusion equation

In the case of the Dirichlet problem for a singularly perturbed parabolic convection-diffusion equation with a small parameter ɛ multiplying the higher order derivative, a finite difference scheme of improved order of accuracy that converges almost ɛ-uniformly (that is, the convergence rate of this scheme weakly depends on ɛ) is constructed. When ɛ is not very small, this scheme converges with an order of accuracy close to two. For the construction of the scheme, we use the classical monotone (of the first order of accuracy) approximations of the differential equation on a priori adapted locally uniform grids that are uniform in the domains where the solution is improved. The boundaries of such domains are determined using a majorant of the singular component of the grid solution. The accuracy of the scheme is improved using the Richardson technique based on two embedded grids. The resulting scheme converges at the rate of O((ɛ⁻¹ N ^−K ln² N)² + N ⁻²ln⁴ N + N ₀⁻²) as N, N ₀ → ∞, where N and N ₀ determine the number of points in the meshes in x and in t, respectively, and K is a prescribed number of iteration steps used to improve the grid solution. Outside the σ-neighborhood of the lateral boundary near which the boundary layer arises, the scheme converges with the second order in t and with the second order up to a logarithmic factor in x; here, σ = O(N ^{−(K − 1)}ln² N). The almost ɛ-uniformly convergent finite difference scheme converges with the defect of ɛ-uniform convergence ν, namely, under the condition N ⁻¹ ≪ ɛ^ν, where ν determining the required number of iteration steps K (K = K(ν)) can be chosen sufficiently small in the interval (0, 1]. When ɛ⁻¹ = O(N ^{K − 1}), the scheme converges at the rate of O(N ⁻²ln⁴ N + N ₀⁻²).     

Compact difference schemes for heat equation with Neumann boundary conditions (II)

This is the further work on compact finite difference schemes for heat equation with Neumann boundary conditions subsequent to the paper, [Sun, Numer Methods Partial Differential Equations (NMPDE) 25 (2009), 1320–1341]. A different compact difference scheme for the one‐dimensional linear heat equation is developed. Truncation errors of the proposed scheme are O(τ² + h⁴) for interior mesh point approximation and O(τ² + h³) for the boundary condition approximation with the uniform partition. The new obtained scheme is similar to the one given by Liao et al. (NMPDE 22 (2006), 600–616), while the major difference lies in no extension of source terms to outside the computational domain any longer. Compared with ones obtained by Zhao et al. (NMPDE 23 (2007), 949–959) and Dai (NMPDE 27 (2011), 436–446), numerical solutions at all mesh points including two boundary points are computed in our new scheme. The significant advantage of this work is to provide a rigorous analysis of convergence order for the obtained compact difference scheme using discrete energy method. The global accuracy is O(τ² + h⁴) in discrete maximum norm, although the spatial approximation order at the Neumann boundary is one lower than that for interior mesh points. The analytical techniques are important and can be successfully used to solve the open problem presented by Sun (NMPDE 25 (2009), 1320–1341), where analyzed theoretical convergence order of the scheme by Liao et al. (NMPDE 22 (2006), 600–616) is only O(τ² + h^3.5) while the numerical accuracy is O(τ² + h⁴), and convergence order of theoretical analysis for the scheme by Zhao et al. (NMPDE 23 (2007), 949–959) is O(τ² + h^2.5), while the actual numerical accuracy is O(τ² + h³). Following the procedure used for the new obtained difference scheme in this work, convergence orders of these two schemes can be proved rigorously to be O(τ² + h⁴) and O(τ² + h³), respectively. Meanwhile, extension to the case involving the nonlinear reaction term is also discussed, and the global convergence order O(τ² + h⁴) is proved. A compact ADI difference scheme for solving two‐dimensional case is derived. Finally, several examples are given to demonstrate the numerical accuracy of new obtained compact difference schemes. © 2012 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2013     

Maximum error estimates for a compact difference scheme of the coupled nonlinear Schrödinger–Boussinesq equations

The coupled nonlinear Schrödinger–Boussinesq (SBq) equations describe the nonlinear development of modulational instabilities associated with Langmuir field amplitude coupled to intense electromagnetic wave in dispersive media such as plasmas. In this paper, we present a conservative compact difference scheme for the coupled SBq equations and analyze the conservative property and the existence of the scheme. Then we prove that the scheme is convergent with convergence order O(τ² + h⁴) in L_∞‐norm and is stable in L_∞‐norm. Numerical results verify the theoretical analysis.     

A Primitive Non-symmetric 3-Class Association Scheme on 36 Elements with p11 = 0 Exists and is Unique

In this paper we construct a primitive, non-symmetric 3-class association scheme with parameters v = 36, v₁ = 7, p¹₁₁ = 0 and p²₁₁ = 4 and show that such a scheme is determined by its parameters.     

A stationary iterative pseudoinverse algorithm

Iterative methods applied to the normal equationsA ^T Ax=A ^T b are sometimes used for solving large sparse linear least squares problems. However, when the matrix is rank-deficient many methods, although convergent, fail to produce the unique solution of minimal Euclidean norm. Examples of such methods are the Jacobi and SOR methods as well as the preconditioned conjugate gradient algorithm. We analyze here an iterative scheme that overcomes this difficulty for the case of stationary iterative methods. The scheme combines two stationary iterative methods. The first method produces any least squares solution whereas the second produces the minimum norm solution to a consistent system. This work was supported by the Swedish Research Council for Engineering Sciences, TFR.     

Stability and convergence for a complete model of mass diffusion

We propose a fully discrete scheme for approximating a three-dimensional, strongly nonlinear model of mass diffusion, also called the complete Kazhikhov–Smagulov model. The scheme uses a C⁰ finite-element approximation for all unknowns (density, velocity and pressure), even though the density limit, solution of the continuous problem, belongs to H². A first-order time discretization is used such that, at each time step, one only needs to solve two decoupled linear problems for the discrete density and the velocity–pressure, separately.We extend to the complete model, some stability and convergence results already obtained by the last two authors for a simplified model where λ²-terms are not considered, λ being the mass diffusion coefficient. Now, different arguments must be introduced, based mainly on an induction process with respect to the time step, obtaining at the same time the three main properties of the scheme: an approximate discrete maximum principle for the density, weak estimates for the velocity and strong ones for the density. Furthermore, the convergence towards a weak solution of the density-dependent Navier–Stokes problem is also obtained as λ→0 (jointly with the space and time parameters).Finally, some numerical computations prove the practical usefulness of the scheme.     

The Dimension of the Hilbert Scheme of Special Threefolds #

The Hilbert scheme of 3-folds in ? ⁿ , n ≥  6 , that are scrolls over ? ² or over a smooth quadric surface Q  ? ? ³ or that are quadric or cubic fibrations over ? ¹ is studied. All known such threefolds of degree 7  ≤ d ≤  11 are shown to correspond to smooth points of an irreducible component of their Hilbert scheme, whose dimension is computed.     

The effect of table expansion on the program complexity of perfect hash functions

It has been shown by various researchers that designing a perfect hashing function for a fixed set ofn elements requires (n) bits in the worst case. A possible relaxation of this scheme is to partition the set into pages, and design a hash function which maps keys to page addresses, requiring subsequent binary search of the page. We have shown elsewhere that (nk/2 ^k+1)(1 +o(1)) bits are necessary and sufficient to describe such a hash function where the pages are of size 2 ^k . In this paper we examine the additional scheme of expanding the address space of the table, which does substantially improve the hash function complexity of perfect hashing, and show that in contrast, it does not reduce the hash function complexity of the paging scheme.Research supported by NSF Grant CCR-9017125 and by a grant from Texas Instruments.     

A Richardson scheme of the decomposition method for solving singularly perturbed parabolic reaction-diffusion equation

For the one-dimensional singularly perturbed parabolic reaction-diffusion equation with a perturbation parameter ɛ, where ɛ ∈ (0, 1], the grid approximation of the Dirichlet problem on a rectangular domain in the (x, t)-plane is examined. For small ɛ, a parabolic boundary layer emerges in a neighborhood of the lateral part of the boundary of this domain. A new approach to the construction of ɛ-uniformly converging difference schemes of higher accuracy is developed for initial boundary value problems. The asymptotic construction technique is used to design the base decomposition scheme within which the regular and singular components of the grid solution are solutions to grid subproblems defined on uniform grids. The base scheme converges ɛ-uniformly in the maximum norm at the rate of O(N ⁻²ln² N + N ₀⁻¹), where N + 1 and N ₀ + 1 are the numbers of nodes in the space and time meshes, respectively. An application of the Richardson extrapolation technique to the base scheme yields a higher order scheme called the Richardson decomposition scheme. This higher order scheme convergesɛ-uniformly at the rate of O(N ⁻⁴ln⁴ N + N ₀⁻²). For fixed values of the parameter, the convergence rate is O(N ⁻⁴ + N ₀⁻²).     

Numerical solution of first‐order hyperbolic partial differential‐difference equation with shift

In this article, we continue the numerical study of hyperbolic partial differential‐difference equation that was initiated in (Sharma and Singh, Appl Math Comput 9 ). In Sharma and Singh, the authors consider the problem with sufficiently small shift arguments. The term negative shift and positive shift are used for delay and advance arguments, respectively. Here, we propose a numerical scheme that works nicely irrespective of the size of shift arguments. In this article, we consider hyperbolic partial differential‐difference equation with negative or positive shift and present a numerical scheme based on the finite difference method for solving such type of initial and boundary value problems. The proposed numerical scheme is analyzed for stability and convergence in L^∞ norm. Finally, some test examples are given to validate convergence, the computational efficiency of the numerical scheme and the effect of shift arguments on the solution.© 2009 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2010     

Compact difference schemes for heat equation with Neumann boundary conditions

In this article, two recent proposed compact schemes for the heat conduction problem with Neumann boundary conditions are analyzed. The first difference scheme was proposed by Zhao, Dai, and Niu (Numer Methods Partial Differential Eq 23, (2007), 949–959). The unconditional stability and convergence are proved by the energy methods. The convergence order is O(τ² + h^2.5) in a discrete maximum norm. Numerical examples demonstrate that the convergence order of the scheme can not exceeds O(τ² + h³). An improved compact scheme is presented, by which the approximate values at the boundary points can be obtained directly. The second scheme was given by Liao, Zhu, and Khaliq (Methods Partial Differential Eq 22, (2006), 600–616). The unconditional stability and convergence are also shown. By the way, it is reported how to avoid computing the values at the fictitious points. Some numerical examples are presented to show the theoretical results. © 2009 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2009     

The stability and convergence of two linearized finite difference schemes for the nonlinear epitaxial growth model

The numerical simulation of the dynamics of the molecular beam epitaxy (MBE) growth is considered in this article. The governing equation is a nonlinear evolutionary equation that is of linear fourth order derivative term and nonlinear second order derivative term in space. The main purpose of this work is to construct and analyze two linearized finite difference schemes for solving the MBE model. The linearized backward Euler difference scheme and the linearized Crank‐Nicolson difference scheme are derived. The unique solvability, unconditional stability and convergence are proved. The linearized Euler scheme is convergent with the convergence order of O(τ + h²) and linearized Crank‐Nicolson scheme is convergent with the convergence order of O(τ² + h²) in discrete L²‐norm, respectively. Numerical stability with respect to the initial conditions is also obtained for both schemes. Numerical experiments are carried out to demonstrate the theoretical analysis. © 2011 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2011     

Finite difference scheme for time-space fractional diffusion equation with fractional boundary conditions

In this paper, the finite difference scheme is developed for the time-space fractional diffusion equation with Dirichlet and fractional boundary conditions. The time and space fractional derivatives are considered in the senses of Caputo and Riemann-Liouville, respectively. The stability and convergence of the proposed numerical scheme are strictly proved, and the convergence order is O(τ^2−α+h²). Numerical experiments are performed to confirm the accuracy and efficiency of our scheme.     

Convergence of finite element method for linear second‐order wave equations with discontinuous coefficients

A finite element method is proposed and analyzed for hyperbolic problems with discontinuous coefficients. The main emphasize is given on the convergence of such method. Due to low global regularity of the solutions, the error analysis of the standard finite element method is difficult to adopt for such problems. For a practical finite element discretization, optimal error estimates in L^∞(L²) and L^∞(H¹) norms are established for continuous time discretization. Further, a fully discrete scheme based on a symmetric difference approximation is considered, and optimal order convergence in L^∞(H¹) norm is established. © 2013 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2013     

A fully discrete spectral method for fractional Cattaneo equation based on Caputo–Fabrizo derivative

Recently Caputo and Fabrizio introduced a new derivative with fractional order without singular kernel. The derivative can be used to describe the material heterogeneities and the fluctuations of different scales. In this article, we derived a new discretization of Caputo–Fabrizio derivative of order α (1 < α < 2) and applied it into the Cattaneo equation. A fully discrete scheme based on finite difference method in time and Legendre spectral approximation in space is proposed. The stability and convergence of the fully discrete scheme are rigorously established. The convergence rate of the fully discrete scheme in H¹ norm is O(τ² + N^1?m), where τ, N and m are the time‐step size, polynomial degree and regularity in the space variable of the exact solution, respectively. Furthermore, the accuracy and applicability of the scheme are confirmed by numerical examples to support the theoretical results.     

Improved approximations of the solution and derivatives to a singularly perturbed reaction-diffusion equation based on the solution decomposition method

In the case of the Dirichlet problem for a singularly perturbed ordinary differential reaction-diffusion equation, a new approach is used to the construction of finite difference schemes such that their solutions and their normalized first- and second-order derivatives converge in the maximum norm uniformly with respect to a perturbation parameter ɛ ∈(0, 1]; the normalized derivatives are ɛ-uniformly bounded. The key idea of this approach to the construction of ɛ-uniformly convergent finite difference schemes is the use of uniform grids for solving grid subproblems for the regular and singular components of the grid solution. Based on the asymptotic construction technique, a scheme of the solution decomposition method is constructed such that its solution and its normalized first- and second-order derivatives converge ɛ-uniformly at the rate of O(N ⁻²ln² N), where N + 1 is the number of points in the uniform grids. Using the Richardson technique, an improved scheme of the solution decomposition method is constructed such that its solution and its normalized first and second derivatives converge ɛ-uniformly in the maximum norm at the same rate of O(N ⁻⁴ln⁴ N).     

On the order of projective curves

Here we prove the existence of several componentsW of the Hilbert scheme of curves inP ⁿ such that the generalC W has Hartshorne-Rao module with order equal to its diameter.     

Reduction of the number of associate classes of hypercubic association schemes

The reduction of the number of associate classes of some hypercubic association schemes by clubbing certain associate classes has been studied in the paper. It has been found that the reduction of anm-class hypercubic association scheme forv=2 ^m treatments into a 2-class association scheme is always possible. Further it is proved herein that them-class hypercubic association scheme forv=s ^m treatments is reducible (i) to a 3-class association scheme, whens=3 and (ii) to a 2-class association scheme, whens=4, which really hasp ₁₁ ¹ =p ₁₁ ² and hence leads to a series of balanced incomplete block designs.     

A General Approximation Scheme for Attractors of Abstract Parabolic Problems

We consider semilinear problems of the form u′ = Au + f(u), where A generates an exponentially decaying compact analytic C ₀-semigroup in a Banach space E, f:E ^α → E is differentiable globally Lipschitz and bounded (E ^α = D((?A)^α) with the graph norm). Under a very general approximation scheme, we prove that attractors for such problems behave upper semicontinuously. If all equilibrium points are hyperbolic, then there is an odd number of them. If, in addition, all global solutions converge as t → ±∞, then the attractors behave lower semicontinuously. This general approximation scheme includes finite element method, projection and finite difference methods. The main assumption on the approximation is the compact convergence of resolvents, which may be applied to many other problems not related to discretization.