Rational points near planar curves and Diophantine approximation

In this paper, we establish asymptotic formulae with optimal errors for the number of rational points that are close to a planar curve, which unify and extend the results of Beresnevich–Dickinson–Velani [6] and Vaughan–Velani [22]. Furthermore, we complete the Lebesgue theory of Diophantine approximation on weakly non-degenerate planar curves that was initially developed by Beresnevich–Zorin [5] in the divergence case.     

Grand Bochner–Lebesgue space and its associate space

Our aim is to introduce the grand Bochner–Lebesgue space in the spirit of Iwaniec–Sbordone spaces, also known as grand Lebesgue spaces, and prove some of its properties. We will also deal with the associate space for grand Bochner–Lebesgue spaces.     

Geometry of expanding absolutely continuous invariant measures and the liftability problem

We show that for a large class of maps on manifolds of arbitrary finite dimension, the existence of a Gibbs–Markov–Young structure (with Lebesgue as the reference measure) is a necessary as well as sufficient condition for the existence of an invariant probability measure which is absolutely continuous measure (with respect to Lebesgue) and for which all Lyapunov exponents are positive.     

The numerical stability of evaluation schemes for polynomials based on the lagrange interpolation form

For evaluation schemes based on the Lagrangian form of a polynomial with degreen, a rigorous error analysis is performed, taking into account that data, computation and even the nodes of interpolation might be perturbed by round-off. The error norm of the scheme is betweenn ² andn ²+(3n+7) _n , where _n denotes the Lebesgue constant belonging to the nodes. Hence, the error norm is of least possible orderO(n ²) if, for instance, the nodes are chosen to be the Chebyshev points or the Fekete points.     

Efficient quadrature for highly oscillatory integrals involving critical points

This paper based on the Levin collocation method and Levin-type method together with composite two-point Gauss–Legendre quadrature presents efficient quadrature for integral transformations of highly oscillatory functions with critical points. The effectiveness and accuracy of the quadrature are tested.     

A note on the discrete approximation of discontinuous curves and surfaces

This is a note on the paper [A. Kouibia, A.J. López-Linares, M. Pasadas, Approximation of discontinuous curves and surfaces with tangent conditions, J. Comput. Appl. Math. 193 (2006) 51–64]. We consider the constructing problem of a discontinuous parametric curve or surface from a finite set of points and tangent conditions. We develop a method based on the theory of discrete smoothing variational splines conveniently adapted to introduce the tangent conditions and the discontinuity set. We give a convergence result and we analyze some numerical and graphical examples in order to illustrate the effectiveness of the presented method.     

Least-squares polynomial approximation on weakly admissible meshes: Disk and triangle

We construct symmetric polar WAMs (weakly admissible meshes) with low cardinality for least-squares polynomial approximation on the disk. These are then mapped to an arbitrary triangle. Numerical tests show that the growth of the least-squares projection uniform norm is much slower than the theoretical bound, and even slower than that of the Lebesgue constant of the best known interpolation points for the triangle. As opposed to good interpolation points, such meshes are straightforward to compute for any degree. The construction can be extended to polygons by triangulation.     

A deterministic particle method for the Vlasov–Fokker–Planck equation in one dimension

The Vlasov–Fokker–Planck equation is a model for a collisional, electrostatic plasma. The approximation of this equation in one spatial dimension is studied. The equation under consideration is linear in that the electric field is given as a known function that is not internally consistent with the phase space distribution function. The approximation method applied is the deterministic particle method described in Wollman and Ozizmir [Numerical approximation of the Vlasov–Poisson–Fokker–Planck system in one dimension, J. Comput. Phys. 202 (2005) 602–644]. For the present linear problem an analysis of the stability and convergence of the numerical method is carried out. In addition, computations are done that verify the convergence of the numerical solution. It is also shown that the long term asymptotics of the computed solution is in agreement with the steady state solution derived in Bouchut and Dolbeault [On long time asymptotics of the Vlasov–Fokker–Planck equation and of the Vlasov–Poisson–Fokker–Planck system with coulombic and Newtonian potentials, Differential Integral Equations 8(3) (1995) 487–514].     

Error estimators for advection–reaction–diffusion equations based on the solution of local problems

This paper deals with a posteriori error estimates for advection–reaction–diffusion equations. In particular, error estimators based on the solution of local problems are derived for a stabilized finite element method. These estimators are proved to be equivalent to the error, with equivalence constants eventually depending on the physical parameters. Numerical experiments illustrating the performance of this approach are reported.     

On the remainder term of Gauss–Radau quadratures for analytic functions

For analytic functions the remainder term of Gauss–Radau quadrature formulae can be represented as a contour integral with a complex kernel. We study the kernel on elliptic contours with foci at the points ±1$\pm 1$ and a sum of semi-axes ?>1$?>1$ for the Chebyshev weight function of the second kind. Starting from explicit expressions of the corresponding kernels the location of their maximum modulus on ellipses is determined. The corresponding Gautschi's conjecture from [On the remainder term for analytic functions of Gauss–Lobatto and Gauss–Radau quadratures, Rocky Mountain J. Math. 21 (1991), 209–226] is proved.     

Computing Fekete and Lebesgue points: Simplex, square, disk

We have computed point sets with maximal absolute value of the Vandermonde determinant (Fekete points) or minimal Lebesgue constant (Lebesgue points) on three basic bidimensional compact sets: the simplex, the square, and the disk. Using routines of the Matlab Optimization Toolbox, we have obtained some of the best bivariate interpolation sets known so far.     

Cantor singular continuous spectrum for operators along interval exchange transformations

It is shown that Schrödinger operators, with potentials along the shift embedding of Lebesgue almost every interval exchange transformations, have Cantor spectrum of measure zero and pure singular continuous for Lebesgue almost all points of the interval.

     

One-step Taylor–Galerkin methods for convection–diffusion problems

Third and fourth order Taylor–Galerkin schemes have shown to be efficient finite element schemes for the numerical simulation of time-dependent convective transport problems. By contrast, the application of higher-order Taylor–Galerkin schemes to mixed problems describing transient transport by both convection and diffusion appears to be much more difficult. In this paper we develop two new Taylor–Galerkin schemes maintaining the accuracy properties and improving the stability restrictions in convection–diffusion. We also present an efficient algorithm for solving the resulting system of the finite element method. Finally we present two numerical simulations that confirm the properties of the methods.     

Uniqueness for the Navier–Stokes equations and multipliers between Sobolev spaces

We re-prove various uniqueness theorems for the Navier–Stokes equations, stating the assumptions in terms of multipliers between Sobolev spaces instead of Lebesgue or Lorentz spaces.     

Convergence result for the constraint preserving mid-point scheme for micromagnetism

An important progress was recently done in numerical approximation of weak solutions to a micromagnetic model equation. The problem with the nonconvex side-constraint of preserving the length of the magnetization was tackled by using reduced integration. Several schemes were proposed and their convergence to weak solutions was proved. All schemes were derived from the Landau–Lifshitz–Gilbert form of the micromagnetic equation. However, when the precessional term in the original Landau–Lifshitz (LL) form of the micromagnetic equation tends to zero, the above schemes become unusable.     

IMEX Runge–Kutta schemes for reaction–diffusion equations

A fundamental research is carried out into convergence and stability properties of IMEX (implicit–explicit) Runge–Kutta schemes applied to reaction–diffusion equations. It is shown that a fully discrete scheme converges if it satisfies certain conditions using a technique of the B-convergence analysis, developed by Burrage, Hundsdorfer and Verwer in 1986. Stability of the schemes is also examined on the basis of a scalar test equation, proposed by Frank, Hundsdorfer and Verwer in 1997.     

On the semilocal convergence of inexact Newton methods in Banach spaces

We provide two types of semilocal convergence theorems for approximating a solution of an equation in a Banach space setting using an inexact Newton method [I.K. Argyros, Relation between forcing sequences and inexact Newton iterates in Banach spaces, Computing 63 (2) (1999) 134–144; I.K. Argyros, A new convergence theorem for the inexact Newton method based on assumptions involving the second Fréchet-derivative, Comput. Appl. Math. 37 (7) (1999) 109–115; I.K. Argyros, Forcing sequences and inexact Newton iterates in Banach space, Appl. Math. Lett. 13 (1) (2000) 77–80; I.K. Argyros, Local convergence of inexact Newton-like iterative methods and applications, Comput. Math. Appl. 39 (2000) 69–75; I.K. Argyros, Computational Theory of Iterative Methods, in: C.K. Chui, L. Wuytack (Eds.), in: Studies in Computational Mathematics, vol. 15, Elsevier Publ. Co., New York, USA, 2007; X. Guo, On semilocal convergence of inexact Newton methods, J. Comput. Math. 25 (2) (2007) 231–242]. By using more precise majorizing sequences than before [X. Guo, On semilocal convergence of inexact Newton methods, J. Comput. Math. 25 (2) (2007) 231–242; Z.D. Huang, On the convergence of inexact Newton method, J. Zheijiang University, Nat. Sci. Ed. 30 (4) (2003) 393–396; L.V. Kantorovich, G.P. Akilov, Functional Analysis, Pergamon Press, Oxford, 1982; X.H. Wang, Convergence on the iteration of Halley family in weak condition, Chinese Sci. Bull. 42 (7) (1997) 552–555; T.J. Ypma, Local convergence of inexact Newton methods, SIAM J. Numer. Anal. 21 (3) (1984) 583–590], we provide (under the same computational cost) under the same or weaker hypotheses: finer error bounds on the distances involved; an at least as precise information on the location of the solution. Moreover if the splitting method is used, we show that a smaller number of inner/outer iterations can be obtained.     

Convergence and optimization of the parallel method of simultaneous directions for the solution of elliptic problems

For the solution of elliptic problems, fractional step methods and in particular alternating directions (ADI) methods are iterative methods where fractional steps are sequential. Therefore, they only accept parallelization at low level. In [T. Lu, P. Neittaanmäki, X.C. Tai, A parallel splitting-up method for partial differential equations and its applications to Navier–Stokes equations, RAIRO Modél. Math. Anal. Numér. 26 (6) (1992) 673–708], Lu et al. proposed a method where the fractional steps can be performed in parallel. We can thus speak of parallel fractional step (PFS) methods and, in particular, simultaneous directions (SDI) methods. In this paper, we perform a detailed analysis of the convergence and optimization of PFS and SDI methods, complementing what was done in [T. Lu, P. Neittaanmäki, X.C. Tai, A parallel splitting-up method for partial differential equations and its applications to Navier–Stokes equations, RAIRO Modél. Math. Anal. Numér. 26 (6) (1992) 673–708]. We describe the behavior of the method and we specify the good choice of the parameters. We also study the efficiency of the parallelization. Some 2D, 3D and high-dimensional tests confirm our results.     

WEB-spline based mesh-free finite element analysis for the approximation of the stationary Navier–Stokes problem

The objective in this paper is to discuss the existence and the uniqueness of a weighted extended B$B$-spline (WEB-spline) based discrete solution for the stationary incompressible Navier–Stokes equations. The WEB-spline discretization is newly developed methodology which satisfies the inf–sup condition or Ladyshenskaya–Babus?ka–Brezzi (LBB) condition. The main advantage of these new elements over standard finite elements is that they use regular grids instead of irregular partitions of the domain, thus eliminating the difficult and time-consuming pre-processing step. An error estimate for this WEB-spline based discrete solution is also obtained.     

Overlapping Schwarz waveform relaxation method for the solution of the forward–backward heat equation

In this article we analyzed the convergence of the Schwarz waveform relaxation method for solving the forward–backward heat equation. Numerical results are presented for a specific type of model problem.