Numerical solution of the problem of sound emission by a cylindrical piezoelectric vibrator excited by electric pulses

A numerical method is proposed to solve the nonstationary wave problem for a piezoelectric ceramic cylinder immersed in a liquid and excited by an electric signal. The method uses a finite-difference scheme constructed by the integro-interpolation method. A numerical experiment is conducted to analyze the transients in a thin-walled cylinder excited by a step electric pulse.Translated from Vychislitel'naya i Prikladnaya Matematika, No. 61, pp. 30–37, 1987.     

Uniform exponential long time decay for the space semi-discretization of a locally damped wave equation via an artificial numerical viscosity

Summary. We consider the finite-difference space semi-discretization of a locally damped wave equation, the damping being supported in a suitable subset of the domain under consideration, so that the energy of solutions of the damped wave equation decays exponentially to zero as time goes to infinity. The decay rate of the semi-discrete systems turns out to depend on the mesh size h of the discretization and tends to zero as h goes to zero. We prove that adding a suitable vanishing numerical viscosity term leads to a uniform (with respect to the mesh size) exponential decay of the energy of solutions. This numerical viscosity term damps out the high frequency numerical spurious oscillations while the convergence of the scheme towards the original damped wave equation is kept. We discuss this problem in 1D and 2D in the interval and the square respectively. Our method of proof relies on discrete multiplier techniques. Mathematics Subject Classification (1991):65M06     

A new analysis for fractional model of regularized long‐wave equation arising in ion acoustic plasma waves

The key purpose of the present work is to constitute a numerical scheme based on q‐homotopy analysis transform method to examine the fractional model of regularized long‐wave equation. The regularized long‐wave equation explains the shallow water waves and ion acoustic waves in plasma. The proposed technique is a mixture of q‐homotopy analysis method, Laplace transform, and homotopy polynomials. The convergence analysis of the suggested scheme is verified. The scheme provides and n‐curves, which show that the range convergence of series solution is not a local point effects and elucidate that it is superior to homotopy analysis method and other analytical approaches. Copyright © 2017 John Wiley & Sons, Ltd.     

A Legendre spectral element method (SEM) based on the modified bases for solving neutral delay distributed‐order fractional damped diffusion‐wave equation

The main purpose of the current paper is to propose a new numerical scheme based on the spectral element procedure for simulating the neutral delay distributed‐order fractional damped diffusion‐wave equation. To this end, the temporal direction has been discretized by a finite difference formula with convergence order where 1<α<2. In the next, to obtain a full‐discrete scheme, we apply the spectral finite element method on the spatial direction. Furthermore, the unconditional stability of semidiscrete scheme and convergence order of full‐discrete scheme of new technique are discussed. Finally, 2 test problems have been considered to demonstrate the ability and efficiency of the proposed numerical technique.     

Stability of Preconditioned Finite Volume Schemes at Low Mach Numbers

A finite volume method for inviscid unsteady flows at low Mach numbers is studied. The method uses a preconditioning of the dissipation term within the numerical flux function only. It can be observed by numerical experiments that the preconditioned scheme combined with an explicit time integrator is unstable if the time step Δt does not satisfy the requirement to be as the Mach number M tends to zero, whereas the corresponding standard method remains stable up to , M → 0, though producing unphysical results. A comprehensive mathematical substantiation of this numerical phenomenon by means of a von Neumann stability analysis is presented, which reveals that in contrast to the standard approach, the dissipation matrix of the preconditioned numerical flux function possesses an eigenvalue growing like M^–2 as M tends to zero, thus causing the diminishment of the stability region of the explicit scheme. The theoretical results are afterwards confirmed by numerical experiments. AMS subject classification (2000) 35L65, 35C20, 76G25     

A high order method for the numerical solution of two-point boundary value problems

A one step finite difference scheme of order 4 for the numerical solution of the general two-point boundary value problemy=f(t,y),a t b, withg(y(a),y(b))=0 is presented. The global discretization error of the scheme is shown, in sufficiently smooth cases, to have an asymptotic expansion containing even powers of the mesh size only. This justifies the use of Richardson extrapolation (or deferred correction) to obtain high orders of accuracy. A theoretical examination of the new scheme for large systems of equations shows that for a given mesh size it generally requires about twice as much work as the Keller box scheme. However, the expectation of higher accuracy usually justifies this extra computational effort. Some numerical results are given which confirm these expectations and show that the new scheme can be generally competitive with the box scheme.     

A Conservative Space-time Mesh Refinement Method for the 1-D Wave Equation. Part I: Construction

Summary. We propose a new method for space-time refinement for the 1-D wave equation. This method is based on the conservation of a discrete energy through two different discretization grids which guarantees the stability of the scheme. Our approach results in a non-interpolatory scheme whose stability condition is not affected by the transition between the two grids. Mathematics Subject Classification (1991):65M12     

Wave propagation in RTD-based cellular neural networks

This work investigates the existence of monotonic traveling wave and standing wave solutions of RTD-based cellular neural networks in the one-dimensional integer lattice . For nonzero wave speed c, applying the monotone iteration method with the aid of real roots of the corresponding characteristic function of the profile equation, we can partition the parameter space (γ,δ)-plane into four regions such that all the admissible monotonic traveling wave solutions connecting two neighboring equilibria can be classified completely. For the case of c=0, a discrete version of the monotone iteration scheme is established for proving the existence of monotonic standing wave solutions. Furthermore, if γ or δ is zero then the profile equation for the standing waves can be viewed as an one-dimensional iteration map and we then prove the multiplicity results of monotonic standing waves by using the techniques of dynamical systems for maps. Some numerical results of the monotone iteration scheme for traveling wave solutions are also presented.     

Lack of dissipativity is not symplecticness

We show that, when numerically integrating Hamiltonian problems, nondissipative numerical methods do not in general share the advantages possessed by symplectic integrators. Here a numerical method is called nondissipative if, when applied with a small stepsize to the test equationdy/dt = iy, real, has amplification factors of unit modulus. We construct a fourth order, nondissipative, explicit Runge-Kutta-Nyström procedure with small error constants. Numerical experiments show that this scheme does not perform efficiently in the numerical integration of Hamiltonian problems.This research has been supported by project DGICYT PB92-254.     

A new numerical scheme for the nonlinear Schrödinger equation with wave operator

In this paper, a new compact finite difference scheme is proposed for a periodic initial value problem of the nonlinear Schrödinger equation with wave operator. This is an explicit scheme of four levels with a discrete conservation law. The unconditional stability and convergence in maximum norm with order \(O(h^{4}+\tau ^{2})\) are verified by the energy method. Those theoretical results are proved by a numerical experiment and it is also verified that this scheme is better than the previous scheme via comparison.     

A Fully Polynomial Approximation Scheme for Minimizing Makespan of Deteriorating Jobs

A fully polynomial approximation scheme for the problem of scheduling n deteriorating jobs on a single machine to minimize makespan is presented. Each algorithm of the scheme runs in O(n ⁵ L ⁴³) time, where L is the number of bits in the binary encoding of the largest numerical parameter in the input, and is required relative error. The idea behind the scheme is rather general and it can be used to develop fully polynomial approximation schemes for other combinatorial optimization problems. Main feature of the scheme is that it does not require any prior knowledge of lower and/or upper bounds on the value of optimal solutions.     

Convergence of an adaptive semi-Lagrangian scheme for the Vlasov-Poisson system

An adaptive semi-Lagrangian scheme for solving the Cauchy problem associated to the periodic 1+1-dimensional Vlasov-Poisson system in the two- dimensional phase space is proposed and analyzed. A key feature of our method is the accurate evolution of the adaptive mesh from one time step to the next one, based on a rigorous analysis of the local regularity and how it gets transported by the numerical flow. The accuracy of the scheme is monitored by a prescribed tolerance parameter ε which represents the local interpolation error at each time step, in the L ^∞ metric. The numerical solutions are proved to converge in L ^∞ towards the exact ones as ε and Δt tend to zero provided the initial data is Lipschitz and has a finite total curvature, or in other words, that it belongs to . The rate of convergence is , which should be compared to the results of Besse who recently established in (SIAM J Numer Anal 42(1):350–382, 2004) similar rates for a uniform semi-Lagrangian scheme, but requiring that the initial data are in . Several numerical tests illustrate the effectiveness of our approach for generating the optimal adaptive discretizations.     

Detailed Error Analysis for a Fractional Adams Method

We investigate a method for the numerical solution of the nonlinear fractional differential equation D _* y(t)=f(t,y(t)), equipped with initial conditions y ^(k)(0)=y ₀ ^(k), k=0,1,...,–1. Here may be an arbitrary positive real number, and the differential operator is the Caputo derivative. The numerical method can be seen as a generalization of the classical one-step Adams–Bashforth–Moulton scheme for first-order equations. We give a detailed error analysis for this algorithm. This includes, in particular, error bounds under various types of assumptions on the equation. Asymptotic expansions for the error are also mentioned briefly. The latter may be used in connection with Richardson's extrapolation principle to obtain modified versions of the algorithm that exhibit faster convergence behaviour.     

Existence and stability of stationary profiles of the lw scheme

In this paper we study the behavior of difference schemes approximating solutions with shocks of scalar conservation laws When a difference scheme introduces artificial numerical diffusion, for example the Lax-Friedrichs scheme, we experience smearing of the shocks, whereas when a scheme introduces numerical dispersion, for example the Lax-Wendroff scheme, we experience oscillations which decay exponentially fast on both sides of the shock. In his dissertation. Gray Jennings studied approximation by monotone schemes. These contain artificial viscosity and are first-order accurate; they are known to be contractive in the sense of any l^p norm. Jennings showed existence and l¹ stability of traveling discrete smeared shocks for such schemes. Here we study similar questions for the Lax-Wendroff scheme without artificial viscosity; this is a nonmonotone, second-order accurate scheme. We prove existence of a one-parameter family of stationary profiles. We also prove stability of these profiles for small perturbations in the sense of a suitably weighted l² norm. The proof relies on studying the linearized Lax-Wendroff scheme.     

Preserving geometric properties of the exponential matrix by block Krylov subspace methods

Given a large square real matrix A and a rectangular tall matrix Q, many application problems require the approximation of the operation . Under certain hypotheses on A, the matrix preserves the orthogonality characteristics of Q; this property is particularly attractive when the associated application problem requires some geometric constraints to be satisfied. For small size problems numerical methods have been devised to approximate while maintaining the structure properties. On the other hand, no algorithm for large A has been derived with similar preservation properties. In this paper we show that an appropriate use of the block Lanczos method allows one to obtain a structure preserving approximation to when A is skew-symmetric or skew-symmetric and Hamiltonian. Moreover, for A Hamiltonian we derive a new variant of the block Lanczos method that again preserves the geometric properties of the exact scheme. Numerical results are reported to support our theoretical findings, with particular attention to the numerical solution of linear dynamical systems by means of structure preserving integrators. AMS subject classification (2000) 65F10, 65F30, 65D30     

Gaussian collocation via defect correction

Summary For the numerical integration of boundary value problems for first order ordinary differential systems, collocation on Gaussian points is known to provide a powerful method. In this paper we introduce a defect correction method for the iterative solution of such high order collocation equations. The method uses the trapezoidal scheme as the basic discretization and an adapted form of the collocation equations for defect evaluation. The error analysis is based on estimates of the contractive power of the defect correction iteration. It is shown that the iteration producesO(h ²), convergence rates for smooth starting vectors. A new result is that the iteration damps all kind of errors, so that it can also handle non-smooth starting vectors successfully.     

Finite termination of a dual Newton method for convex best <Emphasis Type="Italic">C</Emphasis><Superscript><Emphasis Type="Italic">1</Emphasis></Superscript> interpolation and smoothing

Summary. Given the data (x _i ,y _i )², which are in convex position, the problem is to choose the convex best C ¹ interpolant with the smallest mean square second derivative among all admissible cubic C ¹ -splines on the grid. This problem can be efficiently solved by its dual program, developed by Schmdit and his collaborators in a series of papers. The Newton method remains the core of their suggested numerical scheme. It is observed through numerical experiments that the method terminates in a small number of steps and its total computational complexity is only of O(n). The purpose of this paper is to establish theoretical justification for the Newton method. In fact, we are able to prove its finite termination under a mild condition, and on the other hand, we illustrate that the Newton method may fail if the condition is violated, consistent with what is numerically observed for the Newton method. Corresponding results are also obtained for convex smoothing. Mathematics Subject Classification (2000):41A29, 65D15, 49J52, 90C25The work was supported by the Australian Research Council for the first author and by the Hong Kong Research Grant Council for the second author.     

Structural Stability of Discontinuous Galerkin Schemes

The goal of this work is to determine classes of traveling solitary wave solutions for a differential approximation of a discontinuous Galerkin finite difference scheme by means of an hyperbolic ansatz. It is shown that spurious solitary waves can occur in finite-difference solutions of nonlinear wave equation. The occurence of such a spurious solitary wave, which exhibits a very long life time, results in a non-vanishing numerical error for arbitrary time in unbounded numerical domain. Such a behavior is referred here to have a structural instability of the scheme, since the space of solutions spanned by the numerical scheme encompasses types of solutions (solitary waves in the present case) that are not solutions of the original continuous equations. This paper extends our previous work about classical schemes to discontinuous Galerkin schemes (David and Sagaut in Chaos Solitons Fractals 41(4):2193?C2199, 2009; Chaos Solitons Fractals 41(2):655?C660, 2009).