The static shape control for intelligent structures

A finite element formulation is presented for modeling the plate structure containing distributed piezoelectric sensors and actuators (S/As). A new plate bending element for analysis of the plate with distributed piezoelectric S/As is developed. This element saves much memory and computation time. Using the bending plate element, a general method of static shape control for the intelligent structure is put forth. Two examples are given to illustrate the application of the method presented in this paper. The purpose of the first example is to check the accuracy of the finite element method presented in this paper. The second example is to study the problem of the static shape control for the intelligent structure. It is concluded that the shape of the intelligent structure can reach the desired shape through passive control or active control.     

Empirical mode decomposition-based time grid refinement optimization approach for optimal control problems

This paper presents a novel and efficient grid refinement approach for choosing discretization level of control vector parameterization (CVP) method. Different from the uniform time grid CVP method, the proposed method adaptively refines the time grid knots by applying the empirical mode decomposition at each iteration. An attractive property of the proposed method is that fewer parameters are needed to achieve better optimization results, which means that a high-quality solution can be obtained with lower computation cost. The related derivation shows the advantage of simplicity for implementation. Compared with the existing approaches, for which all the control variables are parameterized on the same time grid, the proposed method is more flexible. A standard optimal control problem is tested as an illustration to demonstrate the validity of the proposed method, results indicate better performance index and lower computation cost of the proposed method.     

Shape recovery for sparse‐data tomography

A two‐dimensional sparse‐data tomographic problem is studied. The target is assumed to be a homogeneous object bounded by a smooth curve. A nonuniform rational basis splines (NURBS) curve is used as a computational representation of the boundary. This approach conveniently provides the result in a format readily compatible with computer‐aided design software. However, the linear tomography task becomes a nonlinear inverse problem because of the NURBS‐based parameterization. Therefore, Bayesian inversion with Markov chain Monte Carlo sampling is used for calculating an estimate of the NURBS control points. The reconstruction method is tested with both simulated data and measured X‐ray projection data. The proposed method recovers the shape and the attenuation coefficient significantly better than the baseline algorithm (optimally thresholded total variation regularization), but at the cost of heavier computation.     

空间圆柱螺旋线的NURBS表示

O．引言用B样条方法或B6zier方法来表示自由曲线、曲面，是在CAD／CAM技术中广泛使用的数学手段．但是由于它们都不能精确地表示除抛物线或抛物面以外的圆锥曲线与初等二次曲面，因此近年来，另一种形式的参数样条-一参数有理多项式方法占据了主导地位．非均匀有理B样条（简称NURBS）已被国际标准组织（ISO）于1991年正式颁布为关于工业产品几何定义的STEP国际标准，将其作为定义产品形状的唯一数学方法．越来越多的CAD系统采用NURBS曲线与曲面来建立图形库，研究各种曲线与曲面的NURBS表示无疑是很有意义的．在描述圆锥曲线…     

An extremum problem in production economics

We consider a linear investment model with cost minimization. The lagged effect of investment on production is allowed for by using a distributed (instead of concentrated) control: the right-hand side of the controlled equation contains an integral of the product of control by a variable coefficient. Constructive optimality conditions are derived, the properties of optimal controls are described, and a method is proposed for approximate computation of the sought optimal control. __________ Translated from Nelineinaya Dinamika i Upravlenie, No. 3, pp. 225–236, 2003.     

用正则化方法求解声波散射反问题

研究了从声波散射场的远场模式的信息来再现散射物边界形状的反问题.首先构造表达散射物特征的指示函数,然后利用该函数之特性,建立求解该类反问题的基本方程,从而确定散射物的边界形状.在这个算法中,不需预先知道散射物的边界类型和形状等知识,从T ikhonov正则化方法进行的数值计算结果表明了该方法是有效的和实用的.     

Optimal resource consumption control of perturbed systems

A method for calculating the optimal resource consumption control of perturbed dynamic systems is developed. This method includes both normal and singular solutions. According to the method proposed, the problem is subdivided into three independent tasks: (1) consideration of the effects of perturbations on the system, (2) computation of the optimal control structure, and (3) computation of the switching instants of the optimal control. The consideration of the influence of perturbations on the system and the transfer to a nonzero final state are reduced to the transformation of the initial and final states of the system. The control structure calculation is based on a specific method of quasi-optimal control formation. The control switching instants are found by using the relationship between deviations in the initial conditions of the conjugate system and deviations of the phase trajectory at the final instant. An iterative algorithm is developed, and its characteristics are considered. Results of modeling and numerical calculations are presented.     

Numerical aspects of the XFEM — The XFEM p–Version

The XFEM is known to approximate the displacements and stresses around a crack tip in a very efficient way. But as we will present in this paper we have to deal with a phenomenon coming along with this method that compels us to use higher order shape functions for those elements that are enriched by the crack tip functions. For the computation of the stress–intensity–factors we are using a J–integral over a circular domain Ω. The accuracy of the results depend on • the radius of Ω • the number of elements used in the XFEM computation • the number of nodes which were enriched by the crack tip functions (number of layers) and • the shape functions which were used for the standard FE term For more information about the XFEM we refer to [1]. (© 2006 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

边界元近奇异积分计算的迭代Sinh-Sigmoidal组合式变换法

精确有效地消除积分的近奇异性是三维边界元法在工程应用中的首要问题.当源点与三角形积分单元间的距离无限趋近于零时,会出现近奇异积分问题,积分单元的形状和投影点的位置都是影响近奇异积分计算精度的重要因素.现有的非线性变换法大多只关注径向上积分的近奇异性,而忽略了角度方向和积分单元形状的影响,在投影点接近三角形积分单元边界的情况下,无法获得令人满意的计算精度,并且对子三角形积分单元的形状非常敏感.因此提出了一种改进的基于自适应分块技术和不同坐标变换的迭代sinh sigmoidal组合式变换法,分别消除径向和角度方向积分的近奇异性,在确保计算精度的同时,大大减小了计算规模.数值算例验证了该方法的有效性.     

A Numerical Method of Local Energy Decay for the Boundary Controllability of Time-Reversible Distributed Parameter Systems

This paper deals with the numerical computation of the boundary controls of linear, time-reversible, second-order evolution systems. Based on a method introduced by Russell ( Stud. Appl. Math. LII(3) (1973)) for the wave equation, a numerical algorithm is proposed for solving this type of problems. The convergence of the method is based on the local energy decay of the solution of a suitable Cauchy problem associated with the original control system. The method is illustrated with several numerical simulations for the Klein–Gordon and the Euler–Bernoulli equations in 1D, the wave equation on a rectangle, and the plate equation on a disk.     

Nonclassical pseudospectral method for the solution of brachistochrone problem

In this paper, nonclassical pseudospectral method is proposed for solving the classic brachistochrone problem. The brachistochrone problem is first formulated as a nonlinear optimal control problem. Properties of nonclassical pseudospectral method are presented, these properties are then utilized to reduce the computation of brachistochrone problem to the solution of algebraic equations. Using this method, the solution to the brachistochrone problem is compared with those in the literature.     

Stability analysis in the inverse Robin transmission problem

In this paper, we consider the conductivity problem with piecewise‐constant conductivity and Robin‐type boundary condition on the interface of discontinuity. When the quantity of interest is the jump of the conductivity, we perform a local stability estimate for a parameterized non‐monotone family of domains. We give also a quantitative stability result of local optimal solution with respect to a perturbation of the Robin parameter. In order to find an optimal solution, we propose a Kohn–Vogelius‐type cost functional over a class of admissible domains subject to two boundary values problems. The analysis of the stability involves the computation of first‐order and second‐order shape derivative of the proposed cost functional, which is performed rigorously by means of shape‐Lagrangian formulation without using the shape sensitivity of the states variables. © 2016 The Author. Mathematical Methods in the Applied Sciences Published by John Wiley & Sons Ltd.     

A closed form type reduction method for piecewise linear interval type-2 fuzzy sets

In this study, a new centroid type reduction method is proposed for piecewise linear interval type-2 fuzzy sets based on geometrical approach. The main idea behind the proposed method relies on the assumption that the part of footprint of uncertainty (FOU) of an interval type-2 fuzzy set (IT2FS) has a constant width where the centroid is searched. This constant width assumption provides a way to calculate the centroid of an IT2FS in closed form by using derivative based optimization without any need of iterations. When the related part of FOU is originally constant width, the proposed method finds the accurate centroid of an IT2FS; otherwise, an enhancement can be performed in the algorithm in order to minimize the error between the accurate and the calculated centroids. Moreover, only analytical formulas are used in the proposed method utilizing geometry. This eliminates the need of using discretization of an IT2FS for the type reduction process which in return naturally improves the accuracy and the computation time. The proposed method is compared with Enhanced Karnik–Mendel Iterative Procedure (EKMIP) in terms of the accuracy and the computation time on seven test fuzzy sets. The results show that the proposed method provides more accurate results with shorter computation time than EKMIP.     

Projective interpolation of polynomial vectors and improved key recovery attack on SFLASH

SFLASH is an instance of the famous C* \(^{-}\) multivariate public key cryptographic schemes and it was chosen by the NESSIE cryptographic project of the European Consortium in 2003 as a candidate signature algorithm used for digital signatures on limited-resource devices. Recently, a successful private key recovery attack on SFLASH was proposed by Bouillaguet, Fouque and Macario-Rat by uncovering the kernel properties of quadratic forms of the central map. The most expensive step in the attack is the calculation of kernel vectors of skew-symmetric matrices over a bivariate polynomial ring. Bouillaguet et al. proposed two methods to accomplish this computation. Both methods involve symbolic computation on bivariate polynomials. The first method computes characteristic polynomials of matrices of polynomials and is very expensive. The second method involves a Gröbner basis computation and so its complexity is difficult to estimate. In this paper, we show this critical step of calculating kernel vectors can be done by numerical computation on field elements instead of symbolic computation. Our method uses a nondeterministic interpolation of polynomial vectors called projective interpolation, and its complexity can be explicitly evaluated. Experiments show that it is much faster, making the total attack on SFLASH about 30 times faster (the critical step is about 100 times faster) than the first method of Bouillaguet et al. The new method is also slighter faster than their second method.     

轴对称弹性动力学问题的重构核插值法

重构核插值法是近年来提出的一种新型无网格方法.该方法的形函数具有点插值性和高阶光滑性,不仅能够直接施加本质边界条件,而且能保证较高的计算精度.为了更有效地求解三维轴对称弹性动力学问题,对重构核插值法(reproducing kernel interpolation method, RKIM)应用于此类问题进行了研究,并发展了相应的数值模拟方法.由于几何形状和边界条件的轴对称性,计算时只需要横截面上离散节点的信息,因而前处理变得简单.采用Newmark-β法进行了时域积分.数值算例表明,轴对称弹性动力学分析的重构核插值法既有无网格方法的优势,又有较高的计算精度.     

一种h型自适应有限单元

ｈ型自适应有限单元在网格局部细划时．会产生非常规节点，从而破坏了一般意义上的单元连续性假定．本文利用参照节点对非常规单元进行坐标和位移插值．为保证单元之间坐标和位移的连续性，本文提出了一组修正的形函数，常用的形函数是它的一个特例．本方法应用于有限元程序时，除形函数外无须做任何改动．算例表明水文的方法具有方法简单、精度高、自由度少、计算量小等优点．     

电力系统多目标优化运营研究

针对智能电网系统的安全与经济运行问题,建立了一个同时考虑经济、环境和安全指标的电网系统多目标优化模型,并运用理想点法对电网系统的多目标优化运营问题进行了相应的决策性分析,然后使用了一种新型的智能计算方法——标杆管理优化算法对该模型进行了求解计算.仿真实例表明,本文提出的决策分析和求解计算方法是切实可行的,具有一定的实用性和灵活性.此外,在计算过程中对一些相关的技术性问题,如对协调模型中的两类不同的控制变量、基因链的构造、约束条件的处理以及目标函数的选取等问题做了一些研究和探讨.     

On Numerical Solution of Shape Inverse Problems

The new method is proposed for the numerical solution of a class of shape inverse problems. The size and the location of a small opening in the domain of integration of an elliptic equation is identified on the basis of an observation. The observation includes the finite number of shape functionals. The approximation of the shape functionals by using the so-called topological derivatives is used to perform the learning process of an artificial neural network. The results of computations for 2D examples show, that the method allows to determine an approximation of the global solution to the inverse problem, sufficiently closed to the exact solution. The proposed method can be extended to the problems with an opening of general shape and to the identification problems of small inclusions. However, the mathematical theory of the proposed approach still requires futher research. In particular, the proof of global convergence of the method is an open problem.     

Modified screening-based Kriging method with cross validation and application to engineering design

In this paper, a basis screening Kriging method using cross validation error is proposed to alleviate computational burden of the dynamic Kriging while maintaining its accuracy. Metamodeling is widely used for design optimization of complex engineering applications where considerable computation time is required. The Kriging method is one of popular metamodeling methods due to its accuracy and efficiency. There have been many attempts to improve accuracy of the Kriging method, and the dynamic Kriging method using cross-validation error, which selects adequate basis functions to best describe the mean structure of a response using a genetic algorithm, achieves outstanding performance in terms of accuracy. However, despite its accuracy, the dynamic Kriging requires very large amounts of computation because of the genetic algorithm and no limitation for order of basis functions. In the proposed method, a basis function set is determined by screening each basis function instead of using the genetic algorithm, which has advantages in computation for high dimensional metamodels or repeated metamodel generation. Numerical studies with four mathematical examples and two engineering applications verify that the proposed basis screening Kriging significantly reduces computation time with similar accuracy as the dynamic Kriging.