A method for calculating the Painlevé transcendents

A numerical method for solving the Cauchy problem for all the six Painlevé equations is proposed. The difficulty of solving these equations is that the unknown functions can have movable (that is, dependent on the initial data) singular points of the pole type. Moreover, the Painlevé III–VI equations may have singularities at points where the solution takes certain finite values. The positions of all these singularities are not a priori known and are determined in the process of solving the equation. The proposed method is based on the transition to auxiliary systems of differential equations in neighborhoods of the indicated points. The equations in these systems and their solutions have no singularities at the corresponding point and its neighborhood. Such auxiliary equations are derived for all Painlevé equations and for all types of singularities. Efficient criteria for transition to auxiliary systems are formulated, and numerical results illustrating the potentials of the method are presented.     

The Uzawa–HSS method for saddle-point problems

Based on the Hermitian and skew-Hermitian splitting iteration scheme, we propose a Uzawa-type iteration method for solving a class of saddle-point problems whose coefficient matrix has non-Hermitian positive definite (1, 1)-block. The convergence properties of this novel method are analyzed, which show that the Uzawa-type iteration method is convergent if the iteration parameters satisfy suitable restrictions.     

The factorization method for the Askey–Wilson polynomials

A special Infeld–Hull factorization is given for the Askey–Wilson second order q-difference operator. It is then shown how to deduce a generalization of the corresponding Askey–Wilson polynomials.     

The Kačanov method for some nonlinear problems

The Kačanov method is an iteration method for solving some nonlinear partial differential equation problems. In each iteration, a linear problem is solved. In this paper, we discuss the use of the Kačanov method in the context of two model problems. We show the convergence of the Kačanov iteration sequences, and derive a posteriori error estimates for the Kačanov iterates. Numerical examples are given showing the convergence of the method and the effectiveness of the a posteriori error estimates.     

The Künneth formula for Hilbert complexes

A variant of the Künneth formula for tensor products of Fredholm complexes of Hilbert spaces is given.     

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.     

The Padé-Rayleigh-Ritz method for solving large hermitian eigenproblems

We make use of the Padé approximants and the Krylov sequencex, Ax,,...,A ^m–1 x in the projection methods to compute a few Ritz values of a large hermitian matrixA of ordern. This process consists in approaching the poles ofR _x()=((I–A)^–1 x,x), the mean value of the resolvant ofA, by those of [m–1/m]_Rx(), where [m–1/m]_Rx() is the Padé approximant of orderm of the functionR _x(). This is equivalent to approaching some eigenvalues ofA by the roots of the polynomial of degreem of the denominator of [m–1/m]_Rx(). This projection method, called the Padé-Rayleigh-Ritz (PRR) method, provides a simple way to determine the minimum polynomial ofx in the Krylov subspace methods for the symmetrical case. The numerical stability of the PRR method can be ensured if the projection subspacem is sufficiently small. The mainly expensive portion of this method is its projection phase, which is composed of the matrix-vector multiplications and, consequently, is well suited for parallel computing. This is also true when the matrices are sparse, as recently demonstrated, especially on massively parallel machines. This paper points out a relationship between the PRR and Lanczos methods and presents a theoretical comparison between them with regard to stability and parallelism. We then try to justify the use of this method under some assumptions.     

The recursion operator method for generalized symmetries and Bäcklund transformations of the Burgers’ equations

In this paper, the generalized symmetries of the second-order Burgers’ equation are obtained through the symmetry transformation method. The Bäcklund transformations (BTs) of the two equations are constructed by the recursion operator method. Then, the infinite number of exact solutions to these equations are investigated in terms of the generalized symmetries and Bäcklund transformations. Furthermore, the Bäcklund transformations and conservation law of the general Burgers’ equations are discussed.     

A numerical method for calculating solitons of the nonlinear Schödinger equation in the axially symmetric case

A numerical method is proposed for determination of the eigenfunctions and eigenvalues of the nonlinear Schrödinger equation in the axially symmetric case. Optical solitons interpreted in the physical sense are found for various values of the nonlinearity coefficient by means of the developed method. As has previously been shown by other authors, such solitons are unstable under small perturbations of their shape. Since the considered problem finds numerous applications, methods providing for soliton stabilization are widely discussed in the literature. One of these methods involves strong modulation of the medium nonlinearity or even the reversal of the nonlinearity sign, which necessitates taking into account the wave reflected from irregularities and analyzing additionally the applicability of the mathematical model. We show that, theoretically, it is possible to stabilize a soliton via weak modulation of the cubic-nonlinearity coefficient. Such modulation ensures alternation of the length of nonlinear layers and enables one to increase the path length by a factor of 70 without a beam collapse.     

The stability of learners’ choices for real-life situations to be used in mathematics

One of the efforts to improve and enhance the performance and achievement in mathematics of learners is the incorporation of life-related contexts in mathematics teaching and assessments. These contexts are normally, with good reasons, decided upon by curriculum makers, textbook authors, teachers and constructors of examinations and tests. However, little or no consideration is given to whether students prefer and find these real-life situations interesting. There is also a dearth of studies dealing explicitly with the real-life situations learners prefer to deal with in mathematics. This issue was investigated and data on students’ choices for contextual issues to be used in mathematics were collected at two time periods. The results indicate that learners’ preferences for contextual situations to be used in mathematics remained fairly stable. It is concluded that real-life issues that learners highly prefer are not normally included in the school mathematics curriculum and that there is a need for a multidisciplinary approach to develop mathematical activities which take into account the expressed preferences of learners.     

Intervention methodology for complex problems: The FAcT–Mirror method

We describe a new intervention methodology for awkward, difficult and/or recurrent situations, leading to the development of pertinent, robust and reliable solutions. A framework is created to deal with the contradictions, antagonisms and paradoxes caused by the inherent differences, which exist between the different stakeholders and the confrontation of multiple strategies between them. Based on the principles of a strategy of trust, developed from an in-depth analysis of the Prisoner’s Dilemma, the method’s originality lies in describing all the interpersonal interactions in a complex situation by making an inventory of the fears, attractions, temptations (FAcTs) that the participants could feel in relation to one another. With a new, common representation of the problem, the stakeholders develop structured recommendations, leading to processes of empowerment and co-operative action.     

The truncated Euler–Maruyama method for stochastic differential delay equations

The numerical solutions of stochastic differential delay equations (SDDEs) under the generalized Khasminskii-type condition were discussed by Mao (Appl. Math. Comput. 217, 5512–5524 2011), and the theory there showed that the Euler–Maruyama (EM) numerical solutions converge to the true solutions in probability. However, there is so far no result on the strong convergence (namely in L ^p ) of the numerical solutions for the SDDEs under this generalized condition. In this paper, we will use the truncated EM method developed by Mao (J. Comput. Appl. Math. 290, 370–384 2015) to study the strong convergence of the numerical solutions for the SDDEs under the generalized Khasminskii-type condition.     

The Laguerre pseudospectral method for the radial Schrödinger equation

By transforming dependent and independent variables, radial Schrödinger equation is converted into a form resembling the Laguerre differential equation. Therefore, energy eigenvalues and wavefunctions of M-dimensional radial Schrödinger equation with a wide range of isotropic potentials are obtained numerically by using Laguerre pseudospectral methods. Comparison with the results from literature shows that the method is highly competitive.     

The Teichmüller TQFT volume conjecture for twist knots

The Teichmüller TQFT, defined by Andersen and Kashaev, gives rise to a quantum invariant of triangulated hyperbolic knot complements; it has an associated volume conjecture, where the hyperbolic volume of the knot appears as a certain asymptotic coefficient.In this note, we announce a proof of this volume conjecture for all twist knots up to 14 crossings; along the way we explicitly compute the partition function of the Teichmüller TQFT for the whole infinite family of twist knots.Among other tools, we use an algorithm of Thurston to construct a convenient ideal triangulation of a twist knot complement, as well as the saddle point method for computing limits of complex integrals with parameters.     

The Viro method for construction of Bernstein-Bézier algebraic hypersurface piece

This paper proposes a new method for the construction of Bernstein-Bézier algebraic hypersurface on a simplex with prescribed topology.The method is based on the combinatorial patchworking of Viro method.The topology of the Viro Bernstein-Bézier algebraic hypersurface piece is also described.     

The first integral method for modified Benjamin–Bona–Mahony equation

In this paper, we use the first integral method for analytic treatment of the modified Benjamin–Bona–Mahony equation. Some exact new solutions are formally derived.     

The hp-MITC finite element method for the Reissner–Mindlin plate problem

The popular MITC finite elements used for the approximation of the Reissner–Mindlin plate are extended to the case where elements of non-uniform degree p distribution are used on locally refined meshes. Such an extension is of particular interest to the hp-version and hp-adaptive finite element methods. A priori error bounds are provided showing that the method is locking-free. The analysis is based on new approximation theoretic results for non-uniform Brezzi–Douglas–Fortin–Marini spaces, and extends the results obtained in the case of uniform order approximation on globally quasi-uniform meshes presented by Stenberg and Suri (SIAM J. Numer. Anal. 34 (1997) 544). Numerical examples illustrating the theoretical results and comparing the performance with alternative standard Galerkin approaches are presented for two new benchmark problems with known analytic solution, including the case where the shear stress exhibits a boundary layer. The new method is observed to be locking-free and able to provide exponential rates of convergence even in the presence of boundary layers.     

The least squares spectral element method for the Cahn–Hilliard equation

The problem of numerically resolving an interface separating two different components is a common problem in several scientific and engineering applications. One alternative is to use phase field or diffuse interface methods such as the Cahn–Hilliard (C–H) equation, which introduce a continuous transition region between the two bulk phases. Different numerical schemes to solve the C–H equation have been suggested in the literature. In this work, the least squares spectral element method (LS-SEM) is used to solve the Cahn–Hilliard equation. The LS-SEM is combined with a time–space coupled formulation and a high order continuity approximation by employing C¹¹p-version hierarchical interpolation functions both in space and time. A one-dimensional case of the Cahn–Hilliard equation is solved and the convergence properties of the presented method analyzed. The obtained solution is in accordance with previous results from the literature and the basic properties of the C–H equation (i.e. mass conservation and energy dissipation) are maintained. By using the LS-SEM, a symmetric positive definite problem is always obtained, making it possible to use highly efficient solvers for this kind of problems. The use of dynamic adjustment of number of elements and order of approximation gives the possibility of a dynamic meshing procedure for a better resolution in the areas close to interfaces.     

Finite element method for Grwünwald–Letnikov time-fractional partial differential equation

In this article, we consider the finite element methods (FEM) for Grwünwald–Letnikov time-fractional diffusion equation, which is obtained from the standard two-dimensional diffusion equation by replacing the first-order time derivative with a fractional derivative (of order α, with 0?h ^r+1?+?τ^2-α), where h, τ and r are the space step size, time step size and polynomial degree, respectively. A numerical example is presented to verify the order of convergence.