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.

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.

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.

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.

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.

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.

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.

断点回归方法及应用实现

目的完整、系统介绍断点回归设计(RDD)原理及统计方法,为其在公共卫生领域应用提供参考。方法在介绍断点回归设计原理基础上,用室内甲醛干预的实例演示了利用Stata软件实现断点回归统计方法的过程,介绍和比较属于参数法的多项式回归和属于非参数法的局部线性回归的分析方法和结果。结果RDD是一种准实验设计,对研究对象没有随机分组,而是选择一个与干预措施有关的变量,根据该变量的取值选择切点划分干预组和对照组。RDD在内部有效性方面优于其他准实验设计,但外部有效性受到一定限制。基于观察性资料的RDD不仅可控制可观测的混杂因素,还可控制无法观测的混杂因素,也更符合伦理道德。在本文实例中,多项式回归和局部线性回归两种分析方法的结果基本一致。结论RDD在公共卫生领域的真实世界研究中有广阔的应用前景,为科学评估干预政策和提供高质量决策依据提供新的思路和方法。

面向数字孪生模型应用的油浸式变压器绕组温度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,相较于同等规模的全阶计算,计算效率有较大幅度地提升。

多分量LFM干扰及动态环境下DBOC信号的捕获

针对双二进制偏移载波(double binary offset carrier,DBOC)信号在多分量线性调频(linear frequency modulation,LFM)干扰和动态环境下捕获算法缺乏的问题,提出布莱克曼窗预处理结合分数阶傅里叶变换(fractionalFouriertransform,FRFT)的干扰抑制算法以及离散多项式相位变换(discretepolynomial-phase transform,DPT)、部分匹配滤波器(partial matching filter,PMF)结合快速傅里叶变换(fast Fourier transform,FFT)加频谱校正的捕获算法。该算法首先对接收信号做布莱克曼窗预处理,抑制干扰谱线输出旁瓣,提高干扰汇聚的精确性;然后利用分级算法快速搜索信号的最优阶数,在保证精度量级的条件下减少了运算量;最后,在对应的最优阶数下做FRFT,结合干扰判断和轮询算法,逐个完成多分量LFM干扰的抑制。对干扰抑制后的信号首先利用定阶算法确定其动态阶数;然后通过DPT对动态信号做降阶处理,去除动态项;最后利用PMF-FFT加频谱校正完成DBOC信号的捕获。仿真结果表明,所提算法能够准确并完全地对三个LFM干扰分量进行逐个抑制,且抑制后的干扰分量不会对其他干扰分量的抑制造成影响。在检测概率达到1时,经过布莱克曼窗预处理后算法的信噪比比经过汉明窗预处理和经过凯塞窗预处理后算法的信噪比分别提升了4 dB和6.4 dB,比未经过预处理算法的信噪比提升了7.2 dB。此外,使用频谱校正可以突出捕获峰值,提高捕获精度。与未经频谱校正算法相比,经过频谱校正后算法的信噪比提升了1.6 dB,且能减少一定的捕获时间。

基于线性调频连续波的合作式通信辐射源测距

针对加速运动目标参数估计中,离散多项式变换方法无法进行非整数估计的问题,本文提出基于瑞夫算法的离散多项式变换法和基于Chirp-Z变换的离散多项式变换法2种新型离散多项式变换算法,对加速运动目标速度和加速度进行估计,并对2种算法的估计误差和计算量进行了分析比较。结果表明:2种算法在信噪比-20 dB时均方误差开始接近克拉美罗界。基于瑞夫算法的离散多项式变换法与3次迭代基于Chirp-Z变换的离散多项式变换法均可在较低信噪比下可实现任意频率的有效估计且性能接近,二者均可实现低信噪比下速度、加速度的有效估计,但基于瑞夫算法的离散多项式变换法计算量远小于3次迭代基于Chirp-Z变换的离散多项式变换法。

基于多项式回归与线性插值的全场纳米谱学成像背景序列预测

全场纳米谱学成像(TXM-XANES)是将透射X射线显微镜(Transmission X-ray Microscope,TXM)与X射线近边吸收结构(X-ray Absorption Near Edge Structural,XANES)有机结合的成像方法,通过测量感兴趣元素K边前后多个能量点的TXM图像,无损获得样品内部纳米尺度化学元素价态分布,已应用于能源材料、生物医学和地球科学等多个学科领域。常规TXM-XANES数据需要采集每个能量点下的图像和背景图像,数据量大,采集时间长,由于纳米尺度下机械结构的不稳定和样品的移动都会对TXM-XANES数据分析产生一定的影响。基于已知数据,利用机器学习的算法建立了多项式回归与线性插值运算模型,实现了仅通过两张谱学背景图像完成背景图像序列预测建模。利用该方法对标准样品及锂电池正极材料进行谱学成像分析,结果表明:相对于常规TXM-XANES方法,该方法具有数据量少、采集时间短等优势,可显著提升TXM-XANES的实验效率。

可认证数据结构综述

可认证数据结构是一种利用密码学技术保证分布式环境中远程数据计算正确性的特殊数据结构.近年来,随着分布式计算的发展,可认证数据结构受到广泛关注.本文为可认证数据结构提供了统一框架,并从类别、构造和应用等方面对可认证数据结构进行系统综述.首先,根据数据和计算的类型对可认证数据结构进行分类.其次,针对各类可认证数据结构,分别介绍其发展历程、构造方法和典型应用.再次,梳理各类可认证数据结构之间的关系.最后,探讨可认证数据结构的发展方向.

DHL序列在奇特征域上的迹表示和线性复杂度

将DHL(Ding-Helleseth-Lam)序列看成是特征为奇素数的有限域Fq上的序列,利用经典四阶分圆的性质和迹函数基本理论,确定了DHL序列的Mattson-Solomon多项式,得到该序列在奇特征域上的迹函数表达式。在此基础上给出了计算该序列在Fq上线性复杂度的一般公式。