Improved error bound for multivariate Chebyshev polynomial interpolation

ABSTRACT

Chebyshev interpolation is a highly effective, intensively studied method and enjoys excellent numerical properties which provides tremendous application potential in mathematical finance. The interpolation nodes are known beforehand, implementation is straightforward and the method is numerically stable. For efficiency, a sharp error bound is essential, in particular for high-dimensional applications. For tensorized Chebyshev interpolation, we present an error bound that improves existing results significantly.     

An iterative method for suboptimal control of linear time-delayed systems

This article presents a new approach for solving the Optimal Control Problem (OCP) of linear time-delay systems with a quadratic cost functional. The proposed method can also be used for designing optimal control time-delay systems with disturbance. In this study, the Variational Iteration Method (VIM) is employed to convert the original Time-Delay Optimal Control Problem (TDOCP) into a sequence of nonhomogeneous linear two-point boundary value problems (TPBVPs). The optimal control law obtained consists of an accurate linear feedback term and a nonlinear compensation term which is the limit of an adjoint vector sequence. The feedback term is determined by solving Riccati matrix differential equation. By using the finite-step iteration of a nonlinear compensation sequence, we can obtain a suboptimal control law. Finally, Illustrative examples are included to demonstrate the validity and applicability of the technique.     

基于Legendre多项式的锂离子电池降阶模型

在Newman模型以及单粒子模型(SPM)的基础上,提出基于Legendre正交多项式的电池模型降阶算法;同时,将固液相物理量的分布纳入模型算法,在提高运算速度的情况下,保证运算精度。以磷酸铁锂(Li Fe PO4)正极锂离子电池为例,对导出的降阶模型进行仿真验证。与全阶模型相比,该模型所计算的电池状态量误差均能保持在2%下。     

Construction of a polynomial invariant annihilation attack of degree 7 for T-310

Abstract

Cryptographic attacks are typically constructed by black-box methods and combinations of simpler properties, for example in [Generalised] Linear Cryptanalysis. In this article, we work with a more recent white-box algebraic-constructive methodology. Polynomial invariant attacks on a block cipher are constructed explicitly through the study of the space of Boolean polynomials which does not have a unique factorisation and solving the so-called Fundamental Equation (FE). Some recent invariant attacks are quite symmetric and exhibit some sort of clear structure, or work only when the Boolean function is degenerate. As a proof of concept, we construct an attack where a highly irregular product of seven polynomials is an invariant for any number of rounds for T-310 under certain conditions on the long term key and for any key and any IV. A key feature of our attack is that it works for any Boolean function which satisfies a specific annihilation property. We evaluate very precisely the probability that our attack works when the Boolean function is chosen uniformly at random.     

利用分段三次多项式提取山谷线和山脊线

通过利用分段三次多项式插值法将地形图中的等高线分段来求曲线的表达式,然后对每段上的表达式采取曲率最大值法,得出等高线弯曲变化的特征点,来提取地形图中的山谷线和山脊线,并选取了某一地区的地形等高线图进行了实验,以验证该方法的正确性。     

Robust non-fragile power system stabilizer

This paper presents a step towards the design of robust non-fragile power system stabilizers (PSSs) for single-machine infinite-bus systems. To ensure resiliency of a robust PSS, the proposed approach presents a characterization of all stabilizers that can guarantee robust stability (RS) over wide range of operating conditions. A three-term controller (x₁ + x₂s)/(1 + x₃s) is considered to accomplish the design. Necessary and sufficient stability constraints for existing of such controller at certain operating point are derived via Routh–Hurwitz criterion. Continuous variation in the operating point is tackled by an interval plant model where RS problem is reduced to simultaneous stabilization of finite number of plants according to Kharitonov theorem. Controller triplets that can robustly stabilize vertex plants are characterized in a similar manner. The most resilient controller is computed at the center of maximum-area inscribed rectangle. Simulation results confirm robustness and resiliency of the proposed stabilizer.     

Stochastic fracture mechanics using polynomial chaos

Crack propagation in metals has long been recognized as a stochastic process. As a consequence, crack propagation rates have been modeled as random variables or as random processes of the continuous. On the other hand, polynomial chaos is a known powerful tool to represent general second order random variables or processes. Hence, it is natural to use polynomial chaos to represent random crack propagation data: nevertheless, no such application has been found in the published literature. In the present article, the large replicate experimental results of Virkler et al. and Ghonem and Dore are used to illustrate how polynomial chaos can be used to obtain accurate representations of random crack propagation data. Hermite polynomials indexed in stationary Gaussian stochastic processes are used to represent the logarithm of crack propagation rates as a function of the logarithm of stress intensity factor ranges. As a result, crack propagation rates become log-normally distributed, as observed from experimental data. The Karhunen–Loève expansion is used to represent the Gaussian process in the polynomial chaos basis. The analytical polynomial chaos representations derived herein are shown to be very accurate, and can be employed in predicting the reliability of structural components subject to fatigue.     

Image analysis by Gaussian-Hermite moments

Orthogonal moments are powerful tools in pattern recognition and image processing applications. In this paper, the Gaussian-Hermite moments based on a set of orthonormal weighted Hermite polynomials are extensively studied. The rotation and translation invariants of Gaussian-Hermite moments are derived algebraically. It is proved that the construction forms of geometric moment invariants are valid for building the Gaussian-Hermite moment invariants. The paper also discusses the computational aspects of Gaussian-Hermite moment, including the recurrence relation and symmetrical property. Just as the other orthogonal moments, an image can be easily reconstructed from its Gaussian-Hermite moments thanks to the orthogonality of the basis functions. Some reconstruction tests with binary and gray-level images (without and with noise) were performed and the obtained results show that the reconstruction quality from Gaussian-Hermite moments is better than that from known Legendre, discrete Tchebichef and Krawtchouk moments. This means Gaussian-Hermite moment has higher image representation ability. The peculiarity of image reconstruction algorithm from Gaussian-Hermite moments is also discussed in the paper. The paper offers an example of classification using Gaussian-Hermite moment invariants as pattern feature and the result demonstrates that Gaussian-Hermite moment invariants perform significantly better than Hu's moment invariants under both noise-free and noisy conditions.     

匀速旋转弹性薄板分布动载荷时域识别

以典型的基于Kirchhoff假设的匀速旋转弹性薄板为对象,研究其动载荷时域识别技术.首先,从结构动力学的正问题着手,建立弹性薄板在匀速旋转情况下受到分布动载荷时的受迫振动微分方程;然后,选取一种通用厚薄板单元并分析其有限元形式;最后,研究对应的基于广义正交多项式的匀速旋转薄板动载荷时域识别技术.数值算例表明,该时域识别技术精度较高,计算稳定性良好,方法简单有效,适合在工程中应用.     

Zernike多项式波面拟合精度研究

光学表面检测的绝大多数情况中,被测光学表面或光学系统的出射波面总是趋于光滑且连续的,这样的波面函数一定可以表示成一个完备的基底函数的线性组合。因此常用Zernike多项式作为基底函数对测量得到的离散数据进行拟合,把实际波面或面形表示为Zernike多项式各项的线性组合。文中研究了Zernike多项式阶数对拟合精度的影响,以及采样点数对拟合精度的影响。得出Zernike多项式拟合波面并非阶数越高越好,阶数过高会使拟合结果出现病态。因此拟合波面要选择合适阶数的Zernike多项式。当多项式阶数选定时,采样点数多有利于提高拟合精度,但采样点的多少并不是提高拟合精度的先决条件。