A general approach to handling missing values in Procrustes analysis

General Procrustes analysis is concerned with transforming a set of given configuration matrices to closest agreement. This paper introduces an approach useful for handling missing values in the configuration matrices in the context of general linear transformations. Centring and/or standardisation are allowed. Simplifications occur in the important case where the transformations are orthogonal. In the most general case, an interesting quadratic constrained optimisation problem appears.     

The tensor Golub–Kahan–Tikhonov method applied to the solution of ill-posed problems with a t-product structure

This paper discusses an application of partial tensor Golub–Kahan bidiagonalization to the solution of large-scale linear discrete ill-posed problems based on the t-product formalism for third-order tensors proposed by Kilmer and Martin (M. E. Kilmer and C. D. Martin, Factorization strategies for third order tensors, Linear Algebra Appl., 435 (2011), pp. 641-658). The solution methods presented first reduce a given (large-scale) problem to a problem of small size by application of a few steps of tensor Golub–Kahan bidiagonalization and then regularize the reduced problem by Tikhonov's method. The regularization operator is a third-order tensor, and the data may be represented by a matrix, that is, a tensor slice, or by a general third-order tensor. A regularization parameter is determined by the discrepancy principle. This results in fully automatic solution methods that neither require a user to choose the number of bidiagonalization steps nor the regularization parameter. The methods presented extend available methods for the solution for linear discrete ill-posed problems defined by a matrix operator to linear discrete ill-posed problems defined by a third-order tensor operator. An interlacing property of singular tubes for third-order tensors is shown and applied. Several algorithms are presented. Computed examples illustrate the advantage of the tensor t-product approach, in comparison with solution methods that are based on matricization of the tensor equation.     

Singularity Structure of Third-Order Dynamical Systems. II

The singularity structure of the solutions of a general third-order system, with polynomial right-hand sides of degree less than or equal to two, is studied about a movable singular point. An algorithm for transforming the given third-order system to a third-order Briot–Bouquet system is presented. The dominant behavior of a solution of the given system near a movable singularity is used to construct a transformation that changes the given system directly to a third-order Briot–Bouquet system. The results of Horn for the third-order Briot–Bouquet system are exploited to give the complete form of the series solutions of the given third-order system; convergence of these series in a deleted neighborhood of the singularity is ensured. This algorithm is used to study the singularity structure of the solutions of the Lorenz system, the Rikitake system, the three-wave interaction problem, the Rabinovich system, the Lotka–Volterra system, and the May–Leonard system for different sets of parameter values. The proposed approach goes far beyond the ARS algorithm.     

Example of a third-order periodic differential equation whose frequency spectrum contains a closed interval

We present an example of a linear homogeneous third-order differential periodic equation all of whose solutions are quasiperiodic functions and whose frequency spectra of zeros, signs, and roots contain the same closed interval of exact values.     

Existence-uniqueness and iterative methods for third-order boundary value problems

In this paper we shall provide necessary and sufficient conditions for the existence and uniqueness of solutions of third-order nonlinear differential equations satisfying three-point boundary conditions. For the linear case, we propose a constructive method which is a variation of the method of chasing. For the nonlinear problems sufficient conditions are provided to ensure the convergence of a general class of iterative methods. Several examples are also included.     

Eigenvalues of semi-positone Hammerstein integral equations and applications to boundary value problems

Eigenvalue intervals and the existence of finitely many positive eigenfunctions for semi-positone Hammerstein integral equations are obtained. The positive characteristic values and their upper and lower bounds of the corresponding linear Hammerstein integral operators are studied. Applications of the results are given to third-order differential equations with three-point boundary conditions.     

Eigenvalues of semi-positone Hammerstein integral equations and applications to boundary value problems

Eigenvalue intervals and the existence of finitely many positive eigenfunctions for semi-positone Hammerstein integral equations are obtained. The positive characteristic values and their upper and lower bounds of the corresponding linear Hammerstein integral operators are studied. Applications of the results are given to third-order differential equations with three-point boundary conditions.     

Conditions for the Hyperbolicity of a Linear Third-Order Differential Equation in a One-Dimensional Space

We study the general linear third-order differential equation with constant real coefficients in the case of two independent variables. Necessary and sufficient coefficient conditions for the hyperbolicity and strict hyperbolicity of the equation, as well as for the representability of the differential operator occurring in the equation in the form of a composition of first-order operators, are obtained.     

Comparative study on order-reduced methods for linear third-order ordinary differential equations

The linear third-order ordinary differential equation (ODE) can be transformed into a system of two second-order ODEs by introducing a variable replacement, which is different from the common order-reduced approach. We choose the functions p(x) and q(x) in the variable replacement to get different cases of the special order-reduced system for the linear third-order ODE. We analyze the numerical behavior and algebraic properties of the systems of linear equations resulting from the sinc discretizations of these special second-order ODE systems. Then the block-diagonal preconditioner is used to accelerate the convergence of the Krylov subspace iteration methods for solving the discretized system of linear equation. Numerical results show that these order-reduced methods are effective for solving the linear third-order ODEs.     

The Riemann Function for the Third-Order One-Dimensional Pseudoparabolic Equation

In this work, some classes of initial boundary-value problems are investigated in the Sobolev space for the third-order linear pseudoparabolic equation having, in general, nonsmooth coefficients. A new type of Riemann function concept is given for these problems, which is more natural than the classical Riemann-type function concept, and an integral form of the solutions of nonhomogeneous problems can be found more naturally using this concept.     

On the comparison of four different implementations of a third-order ENO scheme of box type for the computation of compressible flow

Following ideas of Abgrall, four different implementations of a third-order ENO scheme on general triangulations are described and examined. Two implementations utilize implicit time stepping where the resulting linear systems are solved by means of a preconditioned GMRES method. Two other schemes are constructed using an explicit Adams method in time. Quadratic polynomial recovery is used to result in a formally third-order accurate space discretisation. While one class of implementations makes use of cell averages defined on boxes and thus is close in spirit to the finite volume idea, the second class of methods considered is completely node-based. In this second case the interpretation as a true finite volume recovery is completely lost but the recovery process is much simpler and cheaper than the original one. Although one would expect a consistency error in the finite difference type implementations no such problem ever occurred in the numerical experiments.Dedicated to Willi Törnig on the occasion of his 65th birthday     

Third-order accurate monotone cubic Hermite interpolants

Monotonicity-preserving interpolants are used in several applications as engineering or computer aided design. In last years some new techniques have been developed. In particular, in Aràndiga (2013) some new methods to design monotone cubic Hermite interpolants for uniform and non-uniform grids are presented and analyzed. They consist on calculating the derivative values introducing the weighted harmonic mean and a non-linear variation. With these changes, the methods obtained are third-order accurate, except in extreme situations. In this paper, a new general mean is used and a third-order interpolant for all cases is gained. We perform several experiments comparing the known techniques as the method proposed by Fritsch and Butland using the Brodlie’s function, PCHIP program of Matlab (Moler, 2004; Wolberg and Alfy, 2002) with the new algorithm.     

Singularity Structure of Third-Order Dynamical Systems. I

A general third-order dynamical system with polynomial right-hand sides of finite degrees in the dependent variables is analyzed to unravel the singularity structure of its solutions about a movable singular point. To that end, the system is first transformed to a second-order Briot–Bouquet system and a third auxiliary equation via a transformation, similar to one used earlier by R. A. Smith in 1973–1974 for a general second-order dynamical system. This transformation imposes some constraints on the coefficients appearing in the general third-order system. The known results for the second-order Briot–Bouquet system are used to explicitly write out Laurent or psi-series solutions of the general third-order system about a movable singularity. The convergence of the relevant series solutions in a deleted neighborhood of the singularity is ensured. The theory developed here is illustrated with the help of the May–Leonard system.     

三阶线性常微分方程Sinc方程组的结构预处理方法

三阶线性常微分方程在天文学和流体力学等学科的研究中有着广泛的应用.本文介绍求解三阶线性常微分方程由Sinc方法离散所得到的线性方程组的结构预处理方法.首先, 我们利用Sinc方法对三阶线性常微分方程进行离散,证明了离散解以指数阶收敛到原问题的精确解.针对离散后线性方程组的系数矩阵的特殊结构, 提出了结构化的带状预处理子,并证明了预处理矩阵的特征值位于复平面上的一个矩形区域之内.然后, 我们引入新的变量将三阶线性常微分方程等价地转化为由两个二阶线性常微分方程构成的常微分方程组, 并利用Sinc方法对降阶后的常微分方程组进行离散.离散后线性方程组的系数矩阵是分块2×2的, 且每一块都是Toeplitz矩阵与对角矩阵的组合.为了利用Krylov子空间方法有效地求解离散后的线性方程组,我们给出了块对角预处理子, 并分析了预处理矩阵的性质.最后, 我们对降阶后二阶线性常微分方程组进行了一些比较研究.数值结果证实了Sinc方法能够有效地求解三阶线性常微分方程.     

三阶微分方程的多区域Legendre-Petrov-Galerkin谱方法

提出三阶微分方程初边值问题的多区域Legendre-Petrov-Galerkin谱方法.对于三阶线性微分方程,证明该方法全离散格式的稳定性,并给出L~2-误差估计.进而将该方法和Legendre配置方法相结合,应用于某些非线性问题.数值算例对单区域和多区域方法的结果进行比较.     

Two-dimensional homogeneous cubic systems: Classification and normal forms–III

This article is the third in a series of works devoted to two-dimensional homogeneous cubic systems. It considers the case where the homogeneous polynomial vector on the right-hand side of the system has a quadratic common factor with real zeros. The set of such systems is divided into classes of linear equivalence, in each of which a simplest system being a third-order normal form is distinguished on the basis of appropriately introduced structural and normalization principles. In fact, this normal form is determined by the coefficient matrix of the right-hand side, which is called a canonical form (CF). Each CF is characterized by an arrangement of nonzero elements, their specific normalization, and a canonical set of admissible values of the unnormalized elements, which ensures that the given CF belongs to a certain equivalence class. In addition, for each CF, (a) conditions on the coefficients of the initial system are obtained, (b) nonsingular linear substitutions reducing the right-hand side of a system satisfying these conditions to a given CF are specified, and (c) the values of the unnormalized elements of the CF thus obtained are given.     

Global synchronization criteria for a class of third-order non-autonomous chaotic systems via linear state error feedback control

This paper investigates the global synchronization of a class of third-order non-autonomous chaotic systems via the master–slave linear state error feedback control. A sufficient global synchronization criterion of linear matrix inequality (LMI) and several algebraic synchronization criteria for single-variable coupling are proven. These LMI and algebraic synchronization criteria are then applied to two classes of well-known third-order chaotic systems, the generalized Lorenz systems and the gyrostat systems, proving that the local synchronization criteria for the chaotic generalized Lorenz systems developed in the existing literature can actually be extended to describe global synchronization and obtaining some easily implemented synchronization criteria for the gyrostat systems.     

A generalization of Clausen’s identity

The paper gives an extension of Clausen’s identity to the square of any Gauss hypergeometric function. Accordingly, solutions of the related third-order linear differential equation are found in terms of certain bivariate series that can reduce to ₃F₂ series similar to those in Clausen’s identity. The general contiguous variation of Clausen’s identity is found as well. The related Chaundy’s identity is generalized without any restriction on the parameters of the Gauss hypergeometric function. The special case of dihedral Gauss hypergeometric functions is underscored.     

半直线上三阶方程的Legendre-Laguerre耦合谱元法

针对建立在半直线上的三阶微分方程,提出Legendre-Laguerre耦合谱元法.通过构造满足试探函数空间和检验函数空间的基函数,分解得到的线性系统的系数矩阵是稀疏的,可以有效地进行求解.数值例子验证了方法的有效性和高精度.     

Weight distribution moments of random linear/coset codes

A simple method is proposed for the calculation of moments of the weight function of a random linear code. Applying this method we compute the exact expression for the third-order covariance of the weight function. The results are also extended to random coset codes.