A convergent three‐level finite difference scheme for solving a dual‐phase‐lagging heat transport equation in spherical coordinates

Heat transport at the microscale is of vital importance in microtechnology applications. The heat transport equation is different from the traditional heat diffusion equation since a second‐order derivative of temperature with respect to time and a third‐order mixed derivative of temperature with respect to space and time are introduced. In this study, we consider the heat transport equation in spherical coordinates and develop a three‐level finite difference scheme for solving the heat transport equation in a microsphere. It is shown that the scheme is convergent, which implies that the scheme is unconditionally stable. Results show that the numerical solution converges to the exact solution. © 2003 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 20: 60–71, 2004.     

A finite difference scheme for solving the heat transport equation at the microscale

Heat transport at the microscale is of vital importance in microtechnology applications. In this study, we develop a finite difference scheme of the Crank‐Nicholson type by introducing an intermediate function for the heat transport equation at the microscale. It is shown by the discrete energy method that the scheme is unconditionally stable. Numerical results show that the solution is accurate. © 1999 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 15: 697–708, 1999     

Designs in Additive Codes over GF(4)

In this paper we discuss the security of digital signature schemes based on error-correcting codes. Several attacks to the Xinmei scheme are surveyed, and some reasons given to explain why the Xinmei scheme failed, such as the linearity of the signature and the redundancy of public keys. Another weakness is found in the Alabbadi-Wicker scheme, which results in a universal forgery attack against it. This attack shows that the Alabbadi-Wicker scheme fails to implement the necessary property of a digital signature scheme: it is infeasible to find a false signature algorithm D from the public verification algorithm E such that E(D ( )) = for all messages . Further analysis shows that this new weakness also applies to the Xinmei scheme.     

A mathematical and physical Study of multiscale deconvolution models of turbulence

This work presents a rigorous analysis of mathematical and physical properties for solutions of multiscale deconvolution turbulence models. We show that solutions of these models exactly conserve model quantities for the integral invariants of fundamental physical importance: kinetic energy, helicity, and (in two dimensions) enstrophy. The kinetic energy conservation is the key that allows us to next apply the phenomenology of homogeneous, isotropic turbulence to establish the existence of a model energy cascade and, in particular, that the cascade exhibits enhanced energy dissipation in a secondary accelerated cascade, which ends at the model's microscale (which we establish is larger than the Kolmogorov microscale). We also prove that the model dissipates energy at the same rate as true turbulent flow, ～ O(U³ ∕ L), independent of Reynolds number. Lastly, we prove the existence of global attractors for the model solutions; the proof of which also shows that solutions are actually one degree of regularity higher than previously known. Copyright © 2012 John Wiley & Sons, Ltd.     

A compact finite difference scheme for solving a three‐dimensional heat transport equation in a thin film

Heat transport at the microscale is of vital importance in microtechnology applications. The heat transport equation differs from the traditional heat diffusion equation in having a second‐order derivative of temperature with respect to time and a third‐order mixed derivative of temperature with respect to space and time. In this study, we develop a high‐order compact finite difference scheme for the heat transport equation at the microscale. It is shown by the discrete Fourier analysis method that the scheme is unconditionally stable. Numerical results show that the solution is accurate. © 2000 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 16: 441–458, 2000     

Finite volume transport schemes

We analyze arbitrary order linear finite volume transport schemes and show asymptotic stability in L ¹ and L ^∞ for odd order schemes in dimension one. It gives sharp fractional order estimates of convergence for BV solutions. It shows odd order finite volume advection schemes are better than even order finite volume schemes. Therefore the Gibbs phenomena is controlled for odd order finite volume schemes. Numerical experiments sustain the theoretical analysis. In particular the oscillations of the Lax–Wendroff scheme for small Courant numbers are correlated with its non stability in L ¹. A scheme of order three is proved to be stable in L ¹ and L ^∞.     

An expanded mixed covolume method for elliptic problems

We consider the mixed covolume method combining with the expanded mixed element for a system of first‐order partial differential equations resulting from the mixed formulation of a general self‐adjoint elliptic problem with a full diffusion tensor. The system can be used to model the transport of a contaminant carried by a flow in porous media. We use the lowest order Raviart‐Thomas mixed element space. We show the first‐order error estimate for the approximate solution in L² norm. We show the superconvergence both for pressure and velocity in certain discrete norms. We also get a finite difference scheme by using proper approximate integration formulas. Finally we give some numerical examples. © 2004 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2005     

Compact high-order finite-element method for elliptic transport problems with variable coefficients

We present a new conforming bilinear Petrov-Galerkin finite-element scheme for elliptic transport problems with variable coefficients. This scheme combines a generalized test function and artificial diffusion to achieve O(h⁴) grid-point accuracy on uniform stencils of 3 × 3 in two dimensions without resorting to the extended stencils of high-order elements. The method is compared with upwind and high-order finite-difference schemes and the standard Galerkin finite-element method for representative test problems. © 1994 John Wiley & Sons, Inc.     

Finite difference methods for a nonlinear and strongly coupled heat and moisture transport system in textile materials

In this paper, we study heat and moisture transport through porous textile materials with phase change, described by a degenerate, nonlinear and strongly coupled parabolic system. An uncoupled finite difference method with semi-implicit Euler scheme in time direction is proposed for the system. We prove the existence and uniqueness of the solution of the finite difference system. The optimal error estimates in both discrete L ² and H ¹ norms are obtained under the condition that the mesh sizes τ and h are smaller than a positive constant, which depends solely upon physical parameters involved. Numerical results are presented to confirm our theoretical analysis and compared with experimental data.     

Minimum Clique Partition in Unit Disk Graphs

The minimum clique partition (MCP) problem is that of partitioning the vertex set of a given graph into a minimum number of cliques. Given n points in the plane, the corresponding unit disk graph (UDG) has these points as vertices, and edges connecting points at distance at most 1. MCP in UDGs is known to be NP-hard and several constant factor approximations are known, including a recent PTAS. We present two improved approximation algorithms for MCP in UDGs with a realization: (I) A polynomial time approximation scheme (PTAS) running in time n^O(1/e2){n^{O(1/\varepsilon^2)}}. This improves on a previous PTAS with n^O(1/e4){n^{O(1/\varepsilon^4)}} running time by Pirwani and Salavatipour (arXiv:0904.2203v1, 2009). (II) A randomized quadratic-time algorithm with approximation ratio 2.16. This improves on a ratio 3 algorithm with O(n ²) running time by Cerioli et al. (Electron. Notes Discret. Math. 18:73–79, 2004).     

Effective elastic properties of 3D polypropylene microstructures of an injection moulded plate via different homogenization schemes

The mechanical properties of a polypropylene (PP) part depend on its morphology and degree of crystallinity. To evaluate its effective elastic behaviour two upscaling schemes are developed and compared. In the 1^st method the spherulites are assumed to be isotropic and vary linearly with the spherulite diameter. In the 2^nd one, the homogenization is performed successively on two scales. At the nanoscale, the bilamina of amorphous and crystalline phases is homogenized. Then, at the microscale, a 3D radial distribution of effective bilamina is homogenized. (© 2011 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

On Spin Models, Modular Invariance, and Duality

A spin model is a triple (X, W ⁺, W ^–), where W ⁺ and W ^– are complex matrices with rows and columns indexed by X which satisfy certain equations (these equations allow the construction of a link invariant from(X, W ⁺, W ^–) ). We show that these equations imply the existence of a certain isomorphism between two algebras and associated with (X, W ⁺, W ^–) . When is the Bose-Mesner algebra of some association scheme, and is a duality of . These results had already been obtained in [15] when W ⁺, W ^– are symmetric, and in [5] in the general case, but the present proof is simpler and directly leads to a clear reformulation of the modular invariance property for self-dual association schemes. This reformulation establishes a correspondence between the modular invariance property and the existence of spin models at the algebraic level. Moreover, for Abelian group schemes, spin models at the algebraic level and actual spin models coincide. We solve explicitly the modular invariance equations in this case, obtaining generalizations of the spin models of Bannai and Bannai [3]. We show that these spin models can be identified with those constructed by Kac and Wakimoto [20] using even rational lattices. Finally we give some examples of spin models at the algebraic level which are not actual spin models.     

Verifiable Partial Escrow of Integer Factors

We construct an efficient interactive protocol for realizing verifiable partial escrow of the factors of an integer n with time-delayed and threshold key recovery features. The computational cost of the new scheme amounts to 10k P multiplications of numbers of size of P, where P is a protocol parameter which permits n of size up to ( P) - 4 to be dealt with and k is a security parameter which controls the error probability for correct key escrow under 1/2^k. The new scheme realizes a practical method for fine tuning the time complexity for factoring an integer, where the complexity tuning has no respect to the size of the integer.     

Application of a Mickens finite‐difference scheme to the cylindrical Bratu‐Gelfand problem

The boundary value problem Δu + λe^u = 0 where u = 0 on the boundary is often referred to as “the Bratu problem.” The Bratu problem with cylindrical radial operators, also known as the cylindrical Bratu‐Gelfand problem, is considered here. It is a nonlinear eigenvalue problem with two known bifurcated solutions for λ < λ_c, no solutions for λ > λ_c and a unique solution when λ = λ_c. Numerical solutions to the Bratu‐Gelfand problem at the critical value of λ_c = 2 are computed using nonstandard finite‐difference schemes known as Mickens finite differences. Comparison of numerical results obtained by solving the Bratu‐Gelfand problem using a Mickens discretization with results obtained using standard finite differences for λ < 2 are given, which illustrate the superiority of the nonstandard scheme. © 2004 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 20: 327–337, 2004     

A higher order richardson scheme for a singularly perturbed semilinear elliptic convection-diffusion equation

The Dirichlet problem on a vertical strip is examined for a singularly perturbed semilinear elliptic convection-diffusion equation. For this problem, the basic nonlinear difference scheme based on the classical approximations on piecewise uniform grids condensing in the vicinity of boundary layers converges ɛ-uniformly with an order at most almost one. The Richardson technique is used to construct a nonlinear scheme that converges ɛ-uniformly with an improved order, namely, at the rate O(N ₁⁻²ln² N ₁ + N ₂⁻²), where N ₁ + 1 and N ₂ + 1 are the number of grid nodes along the x ₁-axis and per unit interval of the x ₂-axis, respectively. This nonlinear basic scheme underlies the linearized iterative scheme, in which the nonlinear term is calculated using the values of the sought function found at the preceding iteration step. The latter scheme is used to construct a linearized iterative Richardson scheme converging ɛ-uniformly with an improved order. Both the basic and improved iterative schemes converge ɛ-uniformly at the rate of a geometric progression as the number of iteration steps grows. The upper and lower solutions to the iterative Richardson schemes are used as indicators, which makes it possible to determine the iteration step at which the same ɛ-uniform accuracy is attained as that of the non-iterative nonlinear Richardson scheme. It is shown that no Richardson schemes exist for the convection-diffusion boundary value problem converging ɛ-uniformly with an order greater than two. Principles are discussed on which the construction of schemes of order greater than two can be based.     

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     

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 ₀⁻²).     

Convergence analysis of a vertex‐centered finite volume scheme for a copper heap leaching model

In this paper a two‐dimensional solute transport model is considered to simulate the leaching of copper ore tailing using sulfuric acid as the leaching agent. The mathematical model consists in a system of differential equations: two diffusion–convection‐reaction equations with Neumann boundary conditions, and one ordinary differential equation. The numerical scheme consists in a combination of finite volume and finite element methods. A Godunov scheme is used for the convection term and an P1‐FEM for the diffusion term. The convergence analysis is based on standard compactness results in L². Some numerical examples illustrate the effectiveness of the scheme. Copyright © 2009 John Wiley & Sons, Ltd.     

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     

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.