The Sinc-collocation method for solving the Thomas–Fermi equation

A numerical technique for solving nonlinear ordinary differential equations on a semi-infinite interval is presented. We solve the Thomas–Fermi equation by the Sinc-Collocation method that converges to the solution at an exponential rate. This method is utilized to reduce the nonlinear ordinary differential equation to some algebraic equations. This method is easy to implement and yields very accurate results.     

Explicit inverse of a tridiagonal k−Toeplitz matrix

Summary We obtain explicit formulas for the entries of the inverse of a nonsingular and irreducible tridiagonal k–Toeplitz matrix A. The proof is based on results from the theory of orthogonal polynomials and it is shown that the entries of the inverse of such a matrix are given in terms of Chebyshev polynomials of the second kind. We also compute the characteristic polynomial of A which enables us to state some conditions for the existence of A^–1. Our results also extend known results for the case when the residue mod k of the order of A is equal to 0 or k–1 (Numer. Math., 10 (1967), pp. 153–161.).The work was supported by CMUC (Centro de Matemática da Universidade de Coimbra) and by Acção Integrada Luso-Espanhola E-6/03     

A second-order accurate numerical method for a fractional wave equation

We study a generalized Crank–Nicolson scheme for the time discretization of a fractional wave equation, in combination with a space discretization by linear finite elements. The scheme uses a non-uniform grid in time to compensate for the singular behaviour of the exact solution at t = 0. With appropriate assumptions on the data and assuming that the spatial domain is convex or smooth, we show that the error is of order k ² + h ², where k and h are the parameters for the time and space meshes, respectively.     

A spectral Galerkin approximation of the Orr-Sommerfeld eigenvalue problem in a semi-infinite domain

Summary The convergence of a Galerkin approximation of the Orr-Sommerfeld eigenvalue problem, which is defined in a semi-infinite domain, is studied theoretically. In case the system of trial functions is based on a composite of Jacobi polynomials and an exponential transform of the semi-infinite domain, the error of the Galerkin approximation is estimated in terms of the transformation parametera and the numberN of trial functions. Finite or infinite-order convergence of the spectral Galerkin method is obtained depending on how the transformation parameter is chosen. If the transformation parameter is fixed, then convergence is of finite order only. However, ifa is varied proportional to 1/N with an exponent 0<<1, then the approximate eigenvalue converges faster than any finite power of 1/N asN. Some numerical examles are given.     

A time- and spaceadaptive algorithm for the linear time-dependent Schrödinger equation

Summary. We prove an a posteriori error estimate for the linear time-dependent Schr?dinger equation in . From this, we derive a residual based local error estimator that allows us to adjust the mesh and the time step size in order to obtain a numerical solution with a prescribed accuracy. As a special feature, the error estimator controls localization and size of the finite computational domain in each time step. An algorithm is described to compute this solution and numerical results in one space dimension are included. Received March 17, 1995     

Quadrature-difference methods for solving linear and nonlinear singular integro-differential equations

Here we propose and justify quadrature-difference methods for solving different kinds (linear, nonlinear and multidimensional) of periodic singular integro-differential equations.     

Algorithms for solving Hermite interpolation problems using the Fast Fourier Transform

We present a method for computing the Hermite interpolation polynomial based on equally spaced nodes on the unit circle with an arbitrary number of derivatives in the case of algebraic and Laurent polynomials. It is an adaptation of the method of the Fast Fourier Transform (FFT) for this type of problems with the following characteristics: easy computation, small number of operations and easy implementation.In the second part of the paper we adapt the algorithm for computing the Hermite interpolation polynomial based on the nodes of the Tchebycheff polynomials and we also study Hermite trigonometric interpolation problems.     

Variance bounds, with an application to norm bounds for commutators

Murthy and Sethi [M.N. Murthy, V.K. Sethi, Sankhya Ser. B 27 (1965) 201-210] gave a sharp upper bound on the variance of a real random variable in terms of the range of values of that variable. We generalise this bound to the complex case and, more importantly, to the matrix case. In doing so, we make contact with several geometrical and matrix analytical concepts, such as the numerical range, and introduce the new concept of radius of a matrix.We also give a new and simplified proof for a sharp upper bound on the Frobenius norm of commutators recently proven by Böttcher and Wenzel [A. Böttcher, D. Wenzel, The Frobenius norm and the commutator, Linear Algebra Appl. 429 (2008) 1864-1885] and point out that at the heart of this proof lies exactly the matrix version of the variance we have introduced. As an immediate application of our variance bounds we obtain stronger versions of Böttcher and Wenzel’s upper bound.     

Homotopy method for solving variational inequalities with bounded box constraints

In this paper, using the Gabriel–Moré smoothing function of the median function, a smooth homotopy method for solving nonsmooth equation reformulation of bounded box constrained variational inequality problem VIP(l,u,F$l,u,F$) is given. Without any monotonicity condition on the defining map F$F$, for starting point chosen almost everywhere in Rⁿ$R^n$, existence and convergence of the homotopy pathway are proven. Nevertheless, it is also proven that, if the starting point is chosen to be an interior point of the box, the proposed homotopy method can also serve as an interior point method.     

Runge–Kutta methods for affinely controlled nonlinear systems

Rooted tree analysis is adapted from stochastic differential equations to derive systematically general Runge–Kutta methods for deterministic affinely controlled nonlinear systems. Order conditions are found and some specific coefficients for second- and third-order methods are determined, which are then used for simulations compared with the Taylor methods for affinely controlled nonlinear systems derived by Grüne and Kloeden.     

Justification of the nonlinear Schrödinger equation in spatially periodic media

The dynamics of the envelopes of spatially and temporarily oscillating wave packets advancing in spatially periodic media can approximately be described by solutions of a Nonlinear Schr?dinger equation. Here we prove estimates for the error made by this formal approximation using Bloch wave analysis, normal form transformations, and Gronwall’s inequality.     

Far from equilibrium steady states of 1D-Schrödinger–Poisson systems with quantum wells I

We describe the asymptotics of the steady states of the out-of-equilibrium Schrödinger–Poisson system, in the regime of quantum wells in a semiclassical island. After establishing uniform estimates on the nonlinearity, we show that the nonlinear steady states lie asymptotically in a finite-dimensional subspace of functions and that the involved spectral quantities are reduced to a finite number of so-called asymptotic resonant energies. The asymptotic finite dimensional nonlinear system is written in a general setting with only a partial information on its coefficients. After this first part, a complete derivation of the asymptotic nonlinear system will be done for some specific cases in a forthcoming article [V. Bonnaillie–Noël, F. Nier, M. Patel, Far from equilibrium steady states of 1D-Schrödinger–Poisson systems with quantum wells II, Prépublications IRMAR, 2007].     

Scaling analysis of multiple-try MCMC methods

Multiple-try methods are extensions of the Metropolis algorithm in which the next state of the Markov chain is selected among a pool of proposals. These techniques have witnessed a recent surge of interest because they lend themselves easily to parallel implementations. We consider extended versions of these methods in which some dependence structure is introduced in the proposal set, extending earlier work by Craiu and Lemieux (2007).We show that the speed of the algorithm increases with the number of candidates in the proposal pool and that the increase in speed is favored by the introduction of dependence among the proposals. A novel version of the hit-and-run algorithm with multiple proposals appears to be very successful.     

Homotopy method for solving ball-constrained variational inequalities

In this paper, we present a smoothing homotopy method for solving ball-constrained variational inequalities by utilizing a similar Chen-Harker-Kanzow-Smale function to smooth Robinson’s normal equation. Without any monotonicity condition on the defining map F, for the starting point chosen almost everywhere in Rⁿ, the existence and convergence of the homotopy pathway are proven. Numerical experiments illustrate that the method is feasible and effective.     

Convergence and stability of implicit runge-kutta methods for systems with multiplicative noise

A class ofimplicit Runge-Kutta schemes for stochastic differential equations affected bymultiplicative Gaussian white noise is shown to be optimal with respect to global order of convergence in quadratic mean. A test equation is proposed in order to investigate the stability of discretization methods for systems of this kind. Herestability is intended in a truly probabilistic sense, as opposed to the recently introduced extension of A-stability to the stochastic context, given for systems with additive noise. Stability regions for the optimal class are also given.Partially supported by the Italian Consiglio Nazionale delle Ricerche.     

A rational spectral collocation method for solving a class of parameterized singular perturbation problems

A new kind of numerical method based on rational spectral collocation with the sinh transformation is presented for solving parameterized singularly perturbed two-point boundary value problems with one boundary layer. By means of the sinh transformation, the original Chebyshev points are mapped onto the transformed ones clustered near the singular points of the problem. The results from asymptotic analysis as regards the singularity of the solution are employed to determine the parameters in the transformation. Numerical experiments including several nonlinear cases illustrate the high accuracy and efficiency of our method.     

A remark about the justification of the nonlinear Schrödinger equation in quadratic spatially periodic media

We prove the validity of a technical assumption necessary in a proof of the validity of the nonlinear Schr?dinger equation as envelope equation in quadratic spatially periodic media.      

A nonmonotone smoothing-type algorithm for solving a system of equalities and inequalities

In this paper, we investigate a smoothing-type algorithm with a nonmonotone line search for solving a system of equalities and inequalities. We prove that the nonmonotone algorithm is globally and locally superlinearly convergent under suitable assumptions. The preliminary numerical results are reported.