Numerical solution to the deflection of thin plates using the two-dimensional Berger equation with a meshless method based on multiple-scale Pascal polynomials

In this study, we employ Pascal polynomial basis in the two-dimensional Berger equation, which is a fourth order partial differential equation with applications to thin elastic plates. The polynomial approximation method based on Pascal polynomial basis can be readily adapted to obtain the numerical solutions of partial differential equations. However, a drawback with the polynomial basis is that the resulting coefficient matrix for the problem considered may be ill-conditioned. Due to this ill-conditioned behavior, we use a multiple-scale Pascal polynomial method for the Berger equation. The ill-conditioned numbers can be mitigated using this approach. Multiple scales are established automatically by selecting the collocation points in the multiple-scale Pascal polynomial method. This method is also a meshless method because there is no requirement to establish complex grids or for numerical integration. We present the solutions of six linear and nonlinear benchmark problems obtained with the proposed method on complexly shaped domains. The results obtained demonstrate the accuracy and effectiveness of the proposed method, as well showing its stability against large noise effects.     

A Tau method with perturbed boundary conditions for certain ordinary differential equations

Ortiz' recursive formulation of the Lanczos Tau method (TM) is a powerful and efficient technique for producing polynomial approximations for initial or boundary value problems. The method consists in obtaining a polynomial which satisfies (i) aperturbed version of the given differential equation, and (ii) the imposed supplementary conditionsexactly. This paper introduces a new form of the TM, (denoted by PTM), for a restricted class of differential equations, in which the differential equations as well as the supplementary conditions areperturbed simultaneously. PTM is compared to the classical TM from the point of view of their errors: it is found that the PTM error is smaller and more oscillatory than that of the TM; we further find that approximations nearly as accurate as minimax polynomial approximations can be constructed by means of the PTM. Detailed formulae are derived for the polynomial approximations in TM and PTM, based on Canonical Polynomials. Moreover, various limiting properties of Tau coefficients are established and it is shown that the perturbation in PTM behaves asymptotically proprtional to a Chebyshev polynomial. Dedicated to Eduardo L. Ortiz on the occasion of his 70th birthday     

Numerical analytical method of studying some linear functional differential equations

This paper presents the results of studying a scalar linear functional differential equation of a delay type ?(t) = a(t)x(t ? 1) + b(t)x(t/q) + f(t), q > 1. Primary attention is given to the original problem with the initial point, when the initial condition is specified at the initial point, and the classical solution, whose substitution into the original equation transforms it into an identity, is sought. The method of polynomial quasi-solutions, based on representation of an unknown function x(t) as a polynomial of degree N, is applied as the method of investigation. Substitution of this function into the original equation yields a residual Δ(t) = O(t ^N ), for which an accurate analytical representation is obtained. In this case, the polynomial quasi-solution is understood as an exact solution in the form of a polynomial of degree N, disturbed because of the residual of the original initial problem. Theorems of existence of polynomial quasi-solutions for the considered linear functional differential equation and exact polynomial solutions have been proved. Results of a numerical experiment are presented.     

A Tau Method with Perturbed Boundary Conditions for Certain Ordinary Differential Equations

Ortiz recursive formulation of the Lanczos Tau method (TM) is a powerful and efficient technique for producing polynomial approximations for initial or boundary value problems. The method consists in obtaining a polynomial which satisfies (i) a perturbed version of the given differential equation, and (ii) the imposed supplementary conditions exactly. This paper introduces a new form of the TM, (denoted by PTM), for a restricted class of differential equations, in which the differential equations as well as the supplementary conditions are perturbed simultaneously. PTM is compared to the classical TM from the point of view of their errors: it is found that the PTM error is smaller and more oscillatory than that of the TM; we further find that approximations nearly as accurate as minimax polynomial approximations can be constructed by means of the PTM. Detailed formulae are derived for the polynomial approximations in TM and PTM, based on Canonical Polynomials. Moreover, various limiting properties of Tau coefficients are established and it is shown that the perturbation in PTM behaves asymptotically proportional to a Chebyshev polynomial.     

Polynomial quasisolutions of linear second-order differential-difference equations

We consider the scalar linear second-order differential-difference equation with delay {fx159-01}. This equation is investigated by the method of polynomial quasisolutions based on the representation of an unknown function in the form of a polynomial {ie159-01}. Upon the substitution of this polynomial in the original equation, the residual Δ(t) = O(t ^N−1) appears. An exact analytic representation of this residual is obtained. We show the close connection between a linear differential-difference equation with variable coefficients and a model equation with constant coefficients, the structure of whose solution is determined by the roots of the characteristic quasipolynomial. __________ Translated from Ukrains’kyi Matematychnyi Zhurnal, Vol. 60, No. 1, pp. 140–152, January, 2008.     

Frequency Tests for the Existence and Stability of Bounded Solutions to Differential Equations of Higher Order

To study a vector-matrix differential equation of order n, the method of integral equations is used. When the Lipschitz condition holds, an existence and uniqueness theorem for a bounded solution and its estimates are obtained. This solution is almost periodic if the nonlinearity is almost periodic, and it is asymptotically Lyapunov stable if the matrix characteristic polynomial is a Hurwitz polynomial. Under a Lipschitztype condition, a theorem on the existence of at least one bounded solution is proved; among the bounded solutions, there is at least one recurrent solution if the nonlinearity is almost periodic. The equation is S-dissipative if the matrix characteristic polynomial is a Hurwitz polynomial.     

矩形薄板弯曲的近似解法——康托洛维奇-伽辽金法

本文从广义梁微分方程出发,推导出三次样条梁函数。由于采用了广义函数,在集中荷载,集中弯矩等得到截断多项式的解。弹性薄板偏微分方程荷载项采用了广义函数(δ函数及σ函数),无论是集中荷载、集中弯矩、均布荷载,小方块荷载都可表示成为x、y两个方向的截断多项式变形曲线。利用康托洛维奇法将偏微分方程转换成为常微分方程,再用伽辽金法可得良好的近似解。文内算例较为丰富,包括各种边界弹性薄板,各种荷载、变截面薄板以及悬臂板等。     

Chebyshev rational matrix approximation with a priori error bounds for linear and Riccati matrix equations

This paper deals with initial value problems for Lipschitz continuous coefficient matrix Riccati equations. Using Chebyshev polynomial matrix approximations the coefficients of the Riccati equation are approximated by matrix polynomials in a constructive way. Then using the Fröbenius method developed in [1], given an admissible error ϵ > 0 and the previously guaranteed existence domain, a rational matrix polynomial approximation is constructed so that the error is less than ϵ in all the existence domain. The approach is also considered for the construction of matrix polynomial approximations of nonhomogeneous linear differential systems avoiding the integration of the transition matrix of the associated homogeneous problem.     

A Systematic Approach to the Exact Roots of Polynomials

A unified framework is introduced for obtaining the exact roots of a polynomial by establishing a corresponding polynomial of one degree less. The approach gives the well-known solutions for the second and third degree polynomials and a new solution for the quartic equation, which is different in form from the classical Ferrari-Cardan solution. In accord with Abel’s proof, the method produces no solution for the quintic equation.      

Solution of a stochastic Darcy equation by polynomial chaos expansion

This paper deals with solving a boundary value problem for the Darcy equation with a random hydraulic conductivity field.We use an approach based on polynomial chaos expansion in a probability space of input data.We use a probabilistic collocation method to calculate the coefficients of the polynomial chaos expansion. The computational complexity of this algorithm is determined by the order of the polynomial chaos expansion and the number of terms in the Karhunen–Loève expansion. We calculate various Eulerian and Lagrangian statistical characteristics of the flow by the conventional Monte Carlo and probabilistic collocation methods. Our calculations show a significant advantage of the probabilistic collocation method over the directMonte Carlo algorithm.     

Polar Varieties,Real Equation Solving,and Data Structures: The Hypersurface Case

In this paper we apply for the first time a new method for multivariate equation solving which was developed for complex root determination to therealcase. Our main result concerns the problem of finding at least one representative point for each connected component of a real compact and smooth hypersurface. The basic algorithm yields a new method for symbolically solving zero-dimensional polynomial equation systems over the complex numbers. One feature of central importance of this algorithm is the use of a problem-adapted data type represented by the data structures arithmetic network and straight-line program (arithmetic circuit). The algorithm finds the complex solutions of any affine zero-dimensional equation system in nonuniform sequential time that ispolynomialin the length of the input (given in straight-line program representation) and an adequately definedgeometric degree of the equation system.Replacing the notion of geometric degree of the given polynomial equation system by a suitably definedreal (or complex) degreeof certain polar varieties associated to the input equation of the real hypersurface under consideration, we are able to find for each connected component of the hypersurface a representative point (this point will be given in a suitable encoding). The input equation is supposed to be given by a straight-line program and the (sequential time) complexity of the algorithm is polynomial in the input length and the degree of the polar varieties mentioned above.     

Interpolating solutions of the Poisson equation in the disk based on Radon projections

We consider an algebraic method for reconstruction of a function satisfying the Poisson equation with a polynomial right-hand side in the unit disk. The given data, besides the right-hand side, is assumed to be in the form of a finite number of values of Radon projections of the unknown function. We first homogenize the problem by finding a polynomial which satisfies the given Poisson equation. This leads to an interpolation problem for a harmonic function, which we solve in the space of harmonic polynomials using a previously established method. For the special case where the Radon projections are taken along chords that form a regular convex polygon, we extend the error estimates from the harmonic case to this Poisson problem. Finally we give some numerical examples.     

Construction of analogs of the Lyapunov equation for a matrix polynomial

We develop a method for localization of the eigenvalues of a matrix polynomial. This method is related to a generalization and solution of the Lyapunov equation.Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 47, No. 3, pp. 337–343, March, 1995.This work was supported by the Ukrainian State Committee on Science and Technology.     

Solution of a singular integro-differential equation with the use of asymptotic polynomials

We suggest a new method for solving a singular equation of elasticity theory, which is based on the use of asymptotic polynomials constructed on the basis of Chebyshev polynomials of the second kind. Under certain conditions imposed on the functions occurring in the operator equation, the approximate solution tends as n → ∞ to the best uniform approximation polynomial, which converges to the exact solution as n increases. The method permits one to express the remainder term of the approximate solution in the form of an infinite sum via linear functionals. If the originally chosen degree of the polynomial does not provide the desired accuracy, then one can find the corresponding term of the remainder starting from which the desired accuracy is attained and compute the polynomial of the corresponding degree. The proof of the convergence is presented for the case in which the variable ranges in a closed interval.     

Smooth solutions of an initial-value problem for some differential difference equations

The subject matter of this paper is an initial-value problem with an initial function for a linear differential difference equation of neutral type. The problem is to find an initial function such that the solution generated by this function has some given smoothness at the points multiple of the delay. The problem is solved using a method of polynomial quasisolutions, which is based on a representation of the unknown function in the form of a polynomial of some degree. Substituting this into the initial problem yields some incorrectness in the sense of degree of polynomials, which is compensated for by introducing some residual into the equation. For this residual, an exact analytical formula as a measure of disturbance of the initial-value problem is obtained. It is shown that if a polynomial quasisolution of degree N is chosen as an initial function for the initial-value problem in question, the solution generated will have smoothness not lower than N at the abutment points.     

Kalman particle swarm optimized polynomials for data classification

Data classification is an important area of data mining. Several well known techniques such as decision tree, neural network, etc. are available for this task. In this paper we propose a Kalman particle swarm optimized (KPSO) polynomial equation for classification for several well known data sets. Our proposed method is derived from some of the findings of the valuable information like number of terms, number and combination of features in each term, degree of the polynomial equation etc. of our earlier work on data classification using polynomial neural network. The KPSO optimizes these polynomial equations with a faster convergence speed unlike PSO. The polynomial equation that gives the best performance is considered as the model for classification. Our simulation result shows that the proposed approach is able to give competitive classification accuracy compared to PNN in many datasets.     

Applications of Sturm sequences to bifurcation analysis of delay differential equation models

This paper formalizes a method used by several others in the analysis of biological models involving delay differential equations. In such a model, the characteristic equation about a steady state is transcendental. This paper shows that the analysis of the bifurcation due to the introduction of the delay term can be reduced to finding whether a related polynomial equation has simple positive real roots. After this result has been established, we utilize Sturm sequences to determine whether a polynomial equation has positive real roots. This work has extended the stability results found in previous papers and provides a novel theorem about stability switches for low degree characteristic equations.     

Die exakte Lösung der Integralgleichungen gewisser Schwingungsprobleme

Summary The vibration problem of certain dynamic systems with polynomial mass and stiffness distributions can be expressed as a Fredholm integral equation with a degenerated, symmetric kernel.If a starting function is chosen appropriately, the eigenfunction can be expressed as a power series. Simple recurrence relations between the coefficients of this power series yield the characteristic equation for the eigenvalues with a finite number of disposable coefficients.This method is applied to a beam and a wedge and leads to the exact solutions.     

非线性耦合标量场方程新的精确行波解

对于具有丰富物理意义和众多应用价值的非线性耦合标量场方程,通过将所求方程约化为初等积分形式,再利用多项完全判别系统对被积函数中的多项式的根进行分类,得到该方程的丰富的精确解,其中包含有理函数型解,孤波解,三角函数型周期解,椭圆函数型周期解,这其中有许多是新解.这一方法是非常简洁而又有力的,对于椭圆方程,它能得到所有可能的解,对于更高阶方程,与其它方法相比,多项式完全判别系统方法是更有力的.     

一类非线性矩阵方程对称解的双迭代算法

利用逆矩阵的Neumann级数形式,将在Schur插值问题中遇到的含未知矩阵二次项之逆的非线性矩阵方程转化为高次多项式矩阵方程,然后采用牛顿算法求高次多项式矩阵方程的对称解,并采用修正共轭梯度法求由牛顿算法每一步迭代计算导出的线性矩阵方程的对称解或者对称最小二乘解,建立求非线性矩阵方程的对称解的双迭代算法.双迭代算法仅要求非线性矩阵方程有对称解,不要求它的对称解唯一,也不对它的系数矩阵做附加限定.数值算例表明,双迭代算法是有效的.