An Extended Numerical Method by Stancu Polynomials for Solution of Integro-Differential Equations Arising in Oscillating Magnetic Fields

In this study, the Bernstein collocation method has been expanded to Stancu collocation method for numerical solution of the charged particle motion for certain configurations of oscillating magnetic fields modelled by a class of linear integro-differential equations. As the method has been improved, the Stancu polynomials that are generalization of the Bernstein polynomials have been used. The method has been tested on a physical problem how the method can be applied. Moreover, numerical results of the method have been compared with the numerical results of the other methods to indicate the efficiency of the method.

面向数字孪生模型应用的油浸式变压器绕组温度POD-RBFLP降阶计算方法

了解油浸式电力变压器绕组的温度情况是保证其运行稳定性的关键,也是当前针对油浸式变压器数字孪生分析的必然需求。为了快速地获得变压器绕组的稳态温度,该文提出一种基于本征正交分解(proper orthogonal decomposition,POD)和包含线性多项式的径向基函数响应面法(radial basis function response surface method including linear polynomial,RBFLP)的降阶计算模型。首先,讨论POD方法的降阶特性,并设计一种基于留一法交叉验证的自适应获得快照矩阵方法,以提高计算精度及效率;其次,采用响应面方法建立POD模态系数与绕组工况的相关关系,旨在实现通过绕组工况快速获得POD模态系数,从而跳过对降阶模型的复杂非线性计算,进而高效重构绕组温度场。相关算例表明,该方法具有较好的计算精度和效率,在50组测试工况下,与全阶计算相比,误差不超过2.5 K,且总计算时间仅为1.45 s;最后,基于110 kV变压器绕组搭建温升试验平台,试验结果表明,降阶计算结果相较于试验结果,平均计算误差不超过2 K,且单步计算时间仅为0.03 s,相较于同等规模的全阶计算,计算效率有较大幅度地提升。

A comparison of piecewise cubic Hermite interpolating polynomials,cubic splines and piecewise linear functions for the approximation of projectile aerodynamics

Modelling and simulation of projectile flight is at the core of ballistic computer software and is essential to the study of performance of rifles and projectiles in various engagement conditions.An effective and representative numerical model of projectile flight requires a relatively good approximation of the aerodynamics.The aerodynamic coefficients of the projectile model should be described as a series of piecewise polynomial functions of the Mach number that ideally meet the following conditions:they are continuous,differentiable at least once,and have a relatively low degree.The paper provides the steps needed to generate such piecewise polynomial functions using readily available tools,and then compares Piecewise Cubic Hermite Interpolating Polynomial(PCHIP),cubic splines,and piecewise linear functions,and their variant,as potential curve fitting methods to approximate the aerodynamics of a generic small arms projectile.A key contribution of the paper is the application of PCHIP to the approximation of projectile aerodynamics,and its evaluation against a set of criteria.Finally,the paper provides a baseline assessment of the impact of the polynomial functions on flight trajectory predictions obtained with 6-degree-of-freedom simulations of a generic projectile.

ORTHOGONAL MATRIX POLYNOMIALS WITH RESPECT TO LINEAR MATRIX MOMENT FUNCTION ALS:THEORY AND APPLICATIONS

In this paper orthogonal matrix polynomials with respect to a right matrix moment functional an introduced. Basic results, important examples and applications to the approximation of matrix integrals are studied. Error bounds for the proposed matrix quadrature rules are given.

High Order IMEX Stochastic Galerkin Schemes for Linear Transport Equation with Random Inputs and Diffusive Scalings

In this paper,we consider the high order method for solving the linear transport equations under diffusive scaling and with random inputs.To tackle the randomness in the problem,the stochastic Galerkin method of the generalized polynomial chaos approach has been employed.Besides,the high order implicit-explicit scheme under the micro-macro decomposition framework and the discontinuous Galerkin method have been employed.We provide several numerical experiments to validate the accuracy and the stochastic asymptotic-preserving property.

Polynomial Complexity Bounds of Mehrotra-type Predictor-corrector Algorithms for Linear Programming over Symmetric Cones

We establish polynomial complexity corrector algorithms for linear programming over bounds of the Mehrotra-type predictor- symmetric cones. We first slightly modify the maximum step size in the predictor step of the safeguard based Mehrotra-type algorithm for linear programming, that was proposed by Salahi et al. Then, using the machinery of Euclidean Jordan algebras, we extend the modified algorithm to symmetric cones. Based on the Nesterov-Todd direction, we obtain O（r log ε1） iteration complexity bound of this algorithm, where r is the rank of the Jordan algebras and ε is the required precision. We also present a new variant of Mehrotra-type algorithm using a new adaptive updating scheme of centering parameter and show that this algorithm enjoys the same order of complexity bound as the safeguard algorithm. We illustrate the numerical behaviour of the methods on some small examples.

Solution of Linear Dynamical Systems Using Lucas Polynomials of the Second Kind

The use of functions, expressible in terms of Lucas polynomials of the second kind, allows us to write down the solution of linear dynamical systems—both in the discrete and continuous case—avoiding the Jordan canonical form of involved matrices. This improves the computational complexity of the algorithms used in literature.

ON CONSERVATIVE APPROXIMATION BY LINEAR POLYNOMIAL OPERATORS AN EXTENSION OF THE BERNSTEIN'S OPERATOR

In this work we slwly linear polynomial operators preserving some consecutive i-convexities and leaving in-verant the polynomtals up to a certain degree. First we study the existence of an incompatibility between the conservation of cenain i-cotivexities and the invariance of a space of polynomials. Interpolation properties are obtained and a theorem by Berens and DcVore about the Bernstein's operator ts extended. Finally, from these results a genera'ized Bernstein's operator is obtained.

Carleman Linearization and Systems of Arbitrary Depth Polynomial Recursions

New approach to systems of polynomial recursions is developed based on the Carleman linearization procedure. The article is divided into two main sections: firstly, we focus on the case of uni-variable depth-one polynomial recurrences. Subsequently, the systems of depth-one polynomial recurrence relations are discussed. The corresponding transition matrix is constructed and upper triangularized. Furthermore, the powers of the transition matrix are calculated using the back substitution procedure. The explicit expression for a solution to a broad family of recurrence relations is obtained. We investigate to which recurrences the framework can be applied and construct sufficient conditions for the method to work. It is shown how introduction of auxiliary variables can be used to reduce arbitrary depth systems to the depth-one system of recurrences dealt with earlier. Finally, the limitations of the method are discussed, outlining possible directions for future research.

Solving the Binary Linear Programming Model in Polynomial Time

The paper presents a technique for solving the binary linear programming model in polynomial time. The general binary linear programming problem is transformed into a convex quadratic programming problem. The convex quadratic programming problem is then solved by interior point algorithms. This settles one of the open problems of whether P = NP or not. The worst case complexity of interior point algorithms for the convex quadratic problem is polynomial. It can also be shown that every liner integer problem can be converted into binary linear problem.

Fast algorithm for determining the minimal polynomial of up^n-periodic sequence

A fast algorithm for determining the minimal polynomial and linear complexity of a upn-periodic sequence over a finite field Fq is given.Let p,q,and u be distinct primes,q a primitive root modulo p2,m the smallest positive integer such that qm≡1 mod u,and gcd（m,p（p-1））=1.An algorithm is used to reduce a periodic upn sequence over Fq to several pn-periodic sequences over Fq（ζ）,where ζ is a u-th primitive root of unity,and an algorithm proposed by Xiao et al.is employed to obtain the minimal polynomial of each pn-periodic sequence.

ORTHOGONAL POLYNOMIALS AND DETERMINANT FORMULAS OF FUNCTION-VALUED PADE-TYPE APPROXIMATION USING FOR SOLUTION OF INTEGRAL EQUATIONS

To solve Fredholm integral equations of the second kind, a generalized linear functional is introduced and a new function-valued Padé-type approximation is defined. By means of the power series expansion of the solution, this method can construct an approximate solution to solve the given integral equation. On the basis of the orthogonal polynomials, two useful determinant expressions of the numerator polynomial and the denominator polynomial for Padé-type approximation are explicitly given.

Novel stability criteria for fuzzy Hopfield neural networks based on an improved homogeneous matrix polynomials technique

The global stability problem of Takagi-Sugeno（T-S） fuzzy Hopfield neural networks（FHNNs） with time delays is investigated.Novel LMI-based stability criteria are obtained by using Lyapunov functional theory to guarantee the asymptotic stability of the FHNNs with less conservatism.Firstly,using both Finsler＇s lemma and an improved homogeneous matrix polynomial technique,and applying an affine parameter-dependent Lyapunov-Krasovskii functional,we obtain the convergent LMI-based stability criteria.Algebraic properties of the fuzzy membership functions in the unit simplex are considered in the process of stability analysis via the homogeneous matrix polynomials technique.Secondly,to further reduce the conservatism,a new right-hand-side slack variables introducing technique is also proposed in terms of LMIs,which is suitable to the homogeneous matrix polynomials setting.Finally,two illustrative examples are given to show the efficiency of the proposed approaches.

L^p INEQUALITIES AND ADMISSIBLE OPERATOR FOR POLYNOMIALS

Let p（z） be a polynomial of degree at most n. In this paper we obtain some new results about the dependence of on [[P（Z）[ls for every α, β∈ C with ｜a｜≤ 1, ｜β｜〉 1, R 〉 r 〉 1, and s 〉 O. Our results not only generalize some well known inequalities, but also are variety of interesting results deduced from them by a fairly uniform procedure.

Numerical Solutions of a Class of Second Order Boundary Value Problems on Using Bernoulli Polynomials

The aim of this paper is to find the numerical solutions of the second order linear and nonlinear differential equations with Dirichlet, Neumann and Robin boundary conditions. We use the Bernoulli polynomials as linear combination to the approximate solutions of 2nd order boundary value problems. Here the Bernoulli polynomials over the interval [0,1] are chosen as trial functions so that care has been taken to satisfy the corresponding homogeneous form of the Dirichlet boundary conditions in the Galerkin weighted residual method. In addition to that the given differential equation over arbitrary finite domain [a,b] and the boundary conditions are converted into its equivalent form over the interval [0,1]. All the formulas are verified by considering numerical examples. The approximate solutions are compared with the exact solutions, and also with the solutions of the existing methods. A reliable good accuracy is obtained in all cases.

A “Hard to Die” Series Expansion and Lucas Polynomials of the Second Kind

We show how to use the Lucas polynomials of the second kind in the solution of a homogeneous linear differential system with constant coefficients, avoiding the Jordan canonical form for the relevant matrix.

On the Minimal Polynomial of a Vector

It is well known that the Cayley-Hamilton theorem is an interesting and important theorem in linear algebras, which was first explicitly stated by A. Cayley and W. R. Hamilton about in 1858, but the first general proof was published in 1878 by G. Frobenius, and numerous others have appeared since then, for example see [1,2]. From the structure theorem for finitely generated modules over a principal ideal domain it straightforwardly follows the Cayley-Hamilton theorem and the proposition that there exists a vector v in a finite dimensional linear space V such that and a linear transformation of V have the same minimal polynomial. In this note, we provide alternative proofs of these results by only utilizing the knowledge of linear algebras.

Effect of Polynomial Expressed Distribution Dust Particles for Unmagnetized Two-Ion-Temperature Dusty Plasma

Linear dispersion relation for linear wave and a Kadomtsev-Petviashvili (KP) equation for nonlinearwave are given for the unmagnetized two-ion-temperature cold dusty plasma with many different dust grain species.The numerical results of variations of linear dispersion with respect to the different dust size distribution are given.Moreover,how the amplitude,width,and propagation velocity of solitary wave vary vs different dust size distribution isalso studied numerically in this paper.

<i>L^p</i>Inequalities for Polynomials

In this paper we consider a problem of investigating the dependence of on for every real or complex number with , , and present certain compact generali- zations which, besides yielding some interesting results as corollaries, include some well-known results, in particular, those of Zygmund, Bernstein, De-Bruijn, Erd?s-Lax and Boas and Rahman as special cases.