A second order numerical scheme for the solution of the one-dimensional Boussinesq equation

A predictor–corrector (P-C) scheme is applied successfully to a nonlinear method arising from the use of rational approximants to the matrix-exponential term in a three-time level recurrence relation. The resulting nonlinear finite-difference scheme, which is analyzed for local truncation error and stability, is solved using a P-C scheme, in which the predictor and the corrector are explicit schemes of order 2. This scheme is accelerated by using a modification (MPC) in which the already evaluated values are used for the corrector. The behaviour of the P-C/MPC schemes is tested numerically on the Boussinesq equation already known from the bibliography free of boundary conditions. The numerical results are derived for both the bad and the good Boussinesq equation and conclusions from the relevant known results are derived.      

Smooth Frame-Path Termination for Higher Order Sigma-Delta Quantization

We study the performance of finite frames for the encoding of vectors by applying standard higher-order sigma-delta quantization to the frame coefficients. Our results are valid for any quantizer with accuracy ε > 0 operating in the no-overload regime. The frames under consideration are obtained from regular sampling of a path in a Hilbert space. In order to achieve error bounds that are comparable to results on higher-order sigma-delta for the quantization of oversampled bandlimited functions, we construct frame paths that terminate smoothly in the zero vector, that is, with an appropriate number of vanishing derivatives at the endpoint.     

Embedding and wavelet decomposition of spaces of minimal splines

On a sequence of embedded nonuniform grids, chains of embedded spaces of minimal splines (not necessarily polynomial) are constructed. The wavelet decomposition is given. The basis wavelets are compactly supported and admit simple analytic representation. The corresponding decomposition and reconstruction formulas are derived. The variety of spaces under consideration is identified with the variety of complete sequences of points of the direct product of an interval and a projective plane. Bibliography: 20 titles. __________ Translated from Problemy Matematicheskogo Analiza, No. 35, 2007, pp. 15–31     

The free Malcev superalgebra on one odd generator and related superalgebras

A base of the universal multiplicative envelope of the free Malcev superalgebra ℳ on one odd generator is constructed. Some corollaries for skew-symmetric functions and central elements in free Malcev and free alternative algebras are obtained. Moreover, a base of the Poisson-Malcev superalgebra of ℳ is constructed. As a corollary, a set of elements that spans the free alternative superalgebra on one odd generator is obtained. __________ Translated from Fundamentalnaya i Prikladnaya Matematika, Vol. 10, No. 4, pp. 97–106, 2004.     

Special features of magnetic susceptibility dispersion in nanocrystalline magnets

It is demonstrated theoretically that the initial (both elastic and viscous) magnetic susceptibility components for nanocrystalline magnets caused by the processes of rotations (in the region of linear response) have resonant rather than relaxation character typical already for the susceptibility component caused by displacements of domain boundaries. __________ Translated from Izvestiya Vysshikh Uchebnykh Zavedenii, Fizika, No. 6, pp. 88–92, June, 2007.     

The diameter of randomly perturbed digraphs and some applications

The central observation of this paper is that if εn random arcs are added to any n‐node strongly connected digraph with bounded degree then the resulting graph has diameter 𝒪(lnn) with high probability. We apply this to smoothed analysis of algorithms and property testing. Smoothed Analysis: Recognizing strongly connected digraphs is a basic computational task in graph theory. Even for digraphs with bounded degree, it is NL‐complete. By XORing an arbitrary bounded degree digraph with a sparse random digraph R ∼ 𝔻_n,ε/n we obtain a “smoothed” instance. We show that, with high probability, a log‐space algorithm will correctly determine if a smoothed instance is strongly connected. We also show that if NL ⫅̸ almost‐L then no heuristic can recognize similarly perturbed instances of (s,t)‐connectivity. Property Testing: A digraph is called k‐linked if, for every choice of 2k distinct vertices s₁,…,s_k,t₁,…,t_k, the graph contains k vertex disjoint paths joining s_r to t_r for r = 1,…,k. Recognizing k‐linked digraphs is NP‐complete for k ≥ 2. We describe a polynomial time algorithm for bounded degree digraphs, which accepts k‐linked graphs with high probability, and rejects all graphs that are at least εn arcs away from being k‐linked. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2007