On the subset sum problem over finite fields

The subset sum problem over finite fields is a well-known NP-complete problem. It arises naturally from decoding generalized Reed–Solomon codes. In this paper, we study the number of solutions of the subset sum problem from a mathematical point of view. In several interesting cases, we obtain explicit or asymptotic formulas for the solution number. As a consequence, we obtain some results on the decoding problem of Reed–Solomon codes.     

A finite algorithm for the Drazin inverse of a polynomial matrix

Based on Greville's finite algorithm for Drazin inverse of a constant matrix we propose a finite numerical algorithm for the Drazin inverse of polynomial matrices. We also present a new proof for Decell's finite algorithm through Greville's finite algorithm.     

Multivariate polynomial interpolation: Aitken–Neville sets and generalized principal lattices

A suitably weakened definition of generalized principal lattices is shown to be equivalent to the recent definition of Aitken–Neville sets.     

Harmonic and refined Rayleigh–Ritz for the polynomial eigenvalue problem

After reviewing the harmonic Rayleigh–Ritz approach for the standard and generalized eigenvalue problem, we discuss several extraction processes for subspace methods for the polynomial eigenvalue problem. We generalize the harmonic and refined Rayleigh–Ritz approaches which lead to new approaches to extract promising approximate eigenpairs from a search space. We give theoretical as well as numerical results of the methods. In addition, we study the convergence of the Jacobi–Davidson method for polynomial eigenvalue problems with exact and inexact linear solves and discuss several algorithmic details. Copyright © 2008 John Wiley & Sons, Ltd.     

Cryptanalysis of the Wu–Dawson Public Key Cryptosystem

A new public key cryptosystem was introduced by Wu and Dawson at the Fourth International Conference on Finite Fields (Fq4). This scheme is similar to the McEliece public key cryptosystem, in the sense that it also can be described in terms of linear error-correcting codes over finite fields. However, in contrast to the McEliece scheme, the security of the Wu–Dawson system is not based on a decoding problem which is assumed to be intractable but on the theory of generalized inverses of matrices over finite fields. The authors compare their scheme with the McEliece scheme and claim that the same level of security can be obtained using smaller codes, therefore reducing the key size. In this note it will be shown that the Wu–Dawson scheme is insecure, i.e., a trapdoor can be computed efficiently from the knowledge of the public key.     

A note on Tutte polynomials and Orlik–Solomon algebras

Let be a (central) arrangement of hyperplanes in and the dependence matroid of the linear forms . The Orlik–Solomon algebra of a matroid is the exterior algebra on the points modulo the ideal generated by circuit boundaries. The graded algebra is isomorphic to the cohomology algebra of the manifold . The Tutte polynomial is a powerful invariant of the matroid . When is a rank 3 matroid and the θ_Hi are complexifications of real linear forms, we will prove that determines . This result partially solves a conjecture of Falk.     

Caffarelli–Kohn–Nirenberg inequalities on Lie groups of polynomial growth

In the setting of a Lie group of polynomial volume growth, we derive inequalities of Caffarelli–Kohn–Nirenberg type, where the weights involved are powers of the Carnot–Caratheodory distance associated with a fixed system of vector fields which satisfy the Hörmander condition. The use of weak spaces is crucial in our proofs and we formulate these inequalities within the framework of Lorentz spaces (a scale of (quasi)‐Banach spaces which extend the more classical Lebesgue spaces) thereby obtaining a refinement of, for instance, Sobolev and Hardy–Sobolev inequalities.     

Conservation laws for Camassa–Holm equation, Dullin–Gottwald–Holm equation and generalized Dullin–Gottwald–Holm equation

In this paper we construct the conservation laws for the Camassa–Holm equation, the Dullin–Gottwald–Holm equation (DGH) and the generalized Dullin–Gottwald–Holm equation (generalized DGH). The variational derivative approach is used to derive the conservation laws. Only first order multipliers are considered. Two multipliers are obtained for the Camassa–Holm equation. For the DGH and generalized DGH equations the variational derivative approach yields two multipliers; thus two conserved vectors are obtained.     

Long-time behaviour for solutions of the Vlasov–Poisson–Fokker–Planck equation

We study the long-time behaviour of solutions of the Vlasov–Poisson–Fokker–Planck equation for initial data small enough and satisfying some suitable integrability conditions. Our analysis relies on the study of the linearized problems with bounded potentials decaying fast enough for large times. We obtain global bounds in time for the fundamental solutions of such problems and their derivatives. This allows to get sharp bounds for the decay of the difference between the solutions of the Vlasov–Poisson–Fokker–Planck equation and the solution of the free equation with the same initial data. Thanks to these bounds, we get an explicit form for the second term in the asymptotic expansion of the solutions for large times. © 1998 B. G. Teubner Stuttgart—John Wiley & Sons, Ltd.     

Variational formulations for Vlasov–Poisson–Fokker–Planck systems

Time‐discrete variational schemes are introduced for both the Vlasov–Poisson–Fokker–Planck (VPFP) system and a natural regularization of the VPFP system. The time step in these variational schemes is governed by a certain Kantorovich functional (or scaled Wasserstein metric). The discrete variational schemes may be regarded as discretized versions of a gradient flow, or steepest descent, of the underlying free energy functionals for these systems. For the regularized VPFP system, convergence of the variational scheme is rigorously established. Copyright © 2000 John Wiley & Sons, Ltd.     

An adaptive algorithm for the Crank–Nicolson scheme applied to a time-dependent convection–diffusion problem

An a posteriori upper bound is derived for the nonstationary convection–diffusion problem using the Crank–Nicolson scheme and continuous, piecewise linear stabilized finite elements with large aspect ratio. Following Lozinski et al. (2009) [13], a quadratic time reconstruction is used.A space and time adaptive algorithm is developed to ensure the control of the relative error in the L²(H¹) norm. Numerical experiments illustrating the efficiency of this approach are reported; it is shown that the error indicator is of optimal order with respect to both the mesh size and the time step, even in the convection dominated regime and in the presence of boundary layers.     

Paley–Wiener and Boas theorems for singular Sturm–Liouville integral transforms

This paper deals with a class of integral transforms arising from a singular Sturm–Liouville problem y″−q(x)y=−λy, x(a,b), in the limit-point case at one end or both ends of the interval (a,b). The paper completely solves the problem of characterization of the image of a function that has compact support (Paley–Wiener theorem) and also of a function that vanishes on some interval (Boas problem) under this class of transforms. The characterizations are obtained with no restriction on q(x) other than being locally integrable.     

The Bishop–Phelps–Bollobás theorem fails for bilinear forms on

In this paper we show that the Bishop–Phelps–Bollobás theorem fails for bilinear forms on l₁×l₁, while it holds for linear operators from l₁ to l_∞.     

One‐level Newton–Krylov–Schwarz algorithm for unsteady non‐linear radiation diffusion problem

In this paper, we present a parallel Newton–Krylov–Schwarz (NKS)‐based non‐linearly implicit algorithm for the numerical solution of the unsteady non‐linear multimaterial radiation diffusion problem in two‐dimensional space. A robust solver technology is required for handling the high non‐linearity and large jumps in material coefficients typically associated with simulations of radiation diffusion phenomena. We show numerically that NKS converges well even with rather large inflow flux boundary conditions. We observe that the approach is non‐linearly scalable, but not linearly scalable in terms of iteration numbers. However, CPU time is more important than the iteration numbers, and our numerical experiments show that the algorithm is CPU‐time‐scalable even without a coarse space given that the mesh is fine enough. This makes the algorithm potentially more attractive than multilevel methods, especially on unstructured grids, where course grids are often not easy to construct. Copyright © 2004 John Wiley & Sons, Ltd.     

Local projection stabilization for advection–diffusion–reaction problems: One-level vs. two-level approach

Local projection stabilization (LPS) of finite element methods is a new technique for the numerical solution of transport-dominated problems. The main aim of this paper is a critical discussion and comparison of the one- and two-level approaches to LPS for the linear advection–diffusion–reaction problem. Moreover, the paper contains several other novel contributions to the theory of LPS. In particular, we derive an error estimate showing not only the usual error dependence on the mesh width but also on the polynomial degree of the finite element space. Based on this error estimate, we propose a definition of the stabilization parameter depending on the data of the solved problem. Unlike other papers on LPS methods, we observe that the consistency error may deteriorate the convergence order. Finally, we explain the relation between the LPS method and residual-based stabilization techniques for simplicial finite elements.     

A stabilized finite element method based on local polynomial pressure projection for the stationary Navier–Stokes equations

This article considers a stabilized finite element approximation for the branch of nonsingular solutions of the stationary Navier–Stokes equations based on local polynomial pressure projection by using the lowest equal-order elements. The proposed stabilized method has a number of attractive computational properties. Firstly, it is free from stabilization parameters. Secondly, it only requires the simple and efficient calculation of Gauss integral residual terms. Thirdly, it can be implemented at the element level. The optimal error estimate is obtained by the standard finite element technique. Finally, comparison with other methods, through a series of numerical experiments, shows that this method has better stability and accuracy.     

A robust semi-explicit difference scheme for the Kuramoto–Tsuzuki equation

In this paper, we propose a robust semi-explicit difference scheme for solving the Kuramoto–Tsuzuki equation with homogeneous boundary conditions. Because the prior estimate in L_∞-norm of the numerical solutions is very hard to obtain directly, the proofs of convergence and stability are difficult for the difference scheme. In this paper, we first prove the second-order convergence in L₂-norm of the difference scheme by an induction argument, then obtain the estimate in L_∞-norm of the numerical solutions. Furthermore, based on the estimate in L_∞-norm, we prove that the scheme is also convergent with second order in L_∞-norm. Numerical examples verify the correction of the theoretical analysis.     

Vibration of a Reissner–Mindlin–Timoshenko plate–beam system

In this paper, we consider a plate–beam system in which the Reissner–Mindlin plate model is combined with the Timoshenko beam model. Natural frequencies and vibration modes for the system are calculated using the finite element method. The interface conditions at the contact between the plate and beams are discussed in some detail. The impact of regularity on the enforcement of certain interface conditions is an important feature of the paper.     

Highly efficient parallel algorithm for finite difference solution to Navier–Stoke''s equation on a hypercube

It has been shown in [Nuclear Science and Engineering 93 (1986) 6799] that the finite difference discretization of Navier–Stoke's equation leads to the solution of N×N system written in the matrix form as My=B, where M is a quasi-tridiagonal having non-zero elements at the top right and bottom left corners. We present an efficient parallel algorithm on a p-processor hypercube implemented in two phases. In phase I a generalization of an algorithm due to Kowalik [High Speed Computation, Springer, New York] is developed which decomposes the above matrix system into smaller quasi-tridiagonal (p+1)×(p+1) subsystem, which is then solved in Phase II using an odd–even reduction method.     

Some well-posed results on the time-fractional Rayleigh–Stokes problem with polynomial and gradient nonlinearities

In this work, we ponder on a Cauchy problem for the Rayleigh–Stokes equation accompanied by polynomial and gradient nonlinearities. We particularly concern about the behavior of mild solutions for the different instances of the nonlinear source term. In the case of polynomial nonlinearities, we present the local-in-time existence and uniqueness of the mild solution. Moreover, we claim that either it is the global-in-time or it blows up at a finite time. With reference to the case that the source function is global Lipschitzian, we observe that the solution always uniquely exists for a finite time and is continuously dependent. Eventually, we establish some regularity results for the mild solution.