检索结果-内蒙古大学图书馆

Nonlinear recursive filter for boost trajectories

JOURNAL OF GUIDANCE CONTROL AND DYNAMICS 2001年第5期24卷 991-997页

作者： Hough, ME Mitre Corp Bedford MA 01730 USA

A nonlinear recursive algorithm is formulated for state vector and covariance estimation of boost trajectories. The thrust acceleration vector of the booster is modeled by a vector-differential equation that includes effects of propellant depletion and attitude motions resulting from gravity-turn maneuvers and other steering maneuvers. This new dynamics model is incorporated in an extended Kalman filter with nine state variables that describe the inertial components of position, velocity, and thrust acceleration. Additional algorithms are described for filter initialization using angle-only measurements from a geostationary sensor and for detection and estimation of the final staging event using measurement residuals. Tracking accuracy and covariance fidelity are assessed by Monte Carlo simulation.

关键词： Sensors Monte Carlo Simulation Propellant Gravity Turn recursive algorithm recursive Filter Angle of Attack Earth Earth Centered Inertial Exhaust Velocity

来源：评论

学校读者我要写书评

暂无评论

Active impulsive noise control using maximum correntropy with adaptive kernel size

引用

MECHANICAL SYSTEMS AND SIGNAL PROCESSING 2017年第PartA期87卷 180-191页

作者： Lu, Lu Zhao, Haiquan Minist Educ Key Lab Magnet Suspens Technol & Maglev Vehicle Chengdu Peoples R China Southwest Jiaotong Univ Sch Elect Engn Chengdu Peoples R China

The active noise control (ANC) based on the principle of superposition is an attractive method to attenuate the noise signals. However, the impulsive noise in the ANC systems will degrade the performance of the controller. In this paper, a filtered-x recursive maximum correntropy (FxRMC) algorithm is proposed based on the maximum correntropy criterion (MCC) to reduce the effect of outliers. The proposed FxRMC algorithm does not requires any priori information of the noise characteristics and outperforms the filtered-x least mean square (FxLMS) algorithm for impulsive noise. Meanwhile, in order to adjust the kernel size of FxRMC algorithm online, a recursive approach is proposed through taking into account the past estimates of error signals over a sliding window. Simulation and experimental results in the context of active impulsive noise control demonstrate that the proposed algorithms achieve much better performance than the existing algorithms in various noise environments.

关键词： Active noise control Impulsive noise recursive algorithm Maximum correntropy Kernel size

来源：评论

学校读者我要写书评

暂无评论

ISOLATED RUPTURE DEGREE OF TREES AND GEAR GRAPHS

引用

NEURAL NETWORK WORLD 2015年第3期25卷 287-300页

作者： Li, F. Nanjing Normal Univ Sch Math Sci Nanjing 210023 Jiangsu Peoples R China Shaoxing Univ Dept Math Shaoxing 312000 Zhejiang Peoples R China

The isolated rupture degree for a connected graph G is defined as ir(G) = max{i(G-S)-vertical bar S vertical bar-m(G-S) : S is an element of C(G)}, where i(G-S) and m(G-S), respectively, denote the number of components which are isolated vertices and the order of a largest component in G-S. C(G) denotes the set of all cut-sets of G. The isolated rupture degree is a new graph parameter which can be used to measure the vulnerability of networks. In this paper, we firstly give a recursive algorithm for computing the isolated rupture degree of trees, and determine the maximum and minimum isolated rupture degree of trees with given order and maximum degree. Then, the exact value of isolated rupture degree of gear graphs are given.. In the final, we determine the rupture degree of the Cartesian product of two special graphs and a special permutation graph.

关键词： Isolated rupture degree vulnerability ir-set recursive algorithm Cartesian product gear graph

来源：评论

学校读者我要写书评

暂无评论

THE FAST HARTLEY TRANSFORM algorithm

引用

IEEE TRANSACTIONS ON COMPUTERS 1987年第2期36卷 147-156页

作者： HOU, HS Electronics and Optics Division The Aerospace Corporation Abstract Authors References Cited By Keywords Metrics Similar Download Citation Email Print Request Permissions

The fast Hartley transform (FHT) is similar to the Cooley-Tukey fast Fourier transform (FFT) but performs much faster because it requires only real arithmetic computations compared to the complex arithmetic computations required by the FFT. Through use of the FHT, discrete cosine transforms (DCT) and discrete Fourier transforms (DFT) can be obtained. The recursive nature of the FHT algorithm derived in this paper enables us to generate the next higher order FHT from two identical lower order FHT"s. In practice, this recursive relationship offers flexibility in programming different sizes of transforms, while the orderly structure of its signal flow-graphs indicates an ease of implementation in VLSI.

关键词： Discrete cosine transform discrete Hartley transform fast Fourier transform fast Hartley transform generalized Cooley-Tukey FFT parallel processing recursive algorithm

来源：评论

学校读者我要写书评

暂无评论

recursive identification of certain structured time-varying state-space models

引用

IEE PROCEEDINGS-CONTROL THEORY AND APPLICATIONS 1997年第5期144卷 489-497页

作者： Moazzam, MH Hesketh, T Clements, DJ Univ New S Wales Sch Elect Engn Sydney NSW 2052 Australia

In this paper the authors develop a recursive algorithm for identification of a possibly overparameterised state-space model for time-varying linear systems. Each parameter of the model is either known, lies in a bounded region, or is unknown. The cost to be minimised, subject to the parameter constraints, is formed from the output prediction error together with penalty terms. The algorithm is adaptive with respect to the penalty terms. Furthermore, the paper develops a state-space balancing method consistent with structure, if possible, and also considers the introduction of a time-varying forgetting factor.

关键词： recursive algorithm state-space model time-varying forgetting factor

来源：评论

学校读者我要写书评

暂无评论

OUTPUT-FEEDBACK CONTROL UNDER RANDOMLY VARYING DISTRIBUTED DELAYS

引用

JOURNAL OF GUIDANCE CONTROL AND DYNAMICS 1994年第4期17卷 701-711页

作者： RAY, A Pennsylvania State Univ. University Park

An output feedback control law has been formulated in a stochastic setting, based on the principles of minimum variance filtering and dynamic programming, for application to processes that are subjected to randomly varying distributed delays. The proposed estimation and control law for delay compensation is built on the concept of the conventional linear quadratic Gaussian (LQG), called delay compensated linear quadratic Gaussian (DCLQG). Although the certainty equivalence property of LQG does not hold for DCLQG in general, the combined state estimation and state feedback approach of DCLQG offers a suboptimal solution to the control problem under randomly varying distributed delays. DCLQG is potentially applicable to analysis and synthesis of control systems for vehicle management of future generation aircraft where a computer network is employed for distributed processing and on-line information exchange between diverse control and decision-making functions. Results of simulation experiments are presented to demonstrate efficacy of the proposed DCLQG algorithm for flight control of an advanced aircraft.

关键词： Full State Feedback Linear Quadratic Gaussian Control Robust Control System Flight Control System Computer Networks Distributed Processing Discrete Event Dynamic System Angle of Attack Flight Envelope recursive algorithm

来源：评论

学校读者我要写书评

暂无评论

Improved 'Order-N' performance algorithm for the simulation of constrained multi-rigid-body dynamic systems

引用

MULTIBODY SYSTEM DYNAMICS 2003年第2期9卷 185-212页

作者： Anderson, KS Critchley, JH Rensselaer Polytech Inst Dept Mech Aeronaut & Nucl Engn Troy NY 12180 USA

This paper presents an algorithm for the efficient numerical analysis and simulation of modest to heavily constrained multi-rigid-body dynamic systems. The algorithm can accommodate the spatial motion of general multi-rigid-body systems containing arbitrarily many closed loops in O(n + m) operations overall for systems containing n generalized coordinates, and m independent algebraic constraints. The presented approach does not suffer from the performance (speed) penalty encountered by most other of the so-called 'O(n)' state-space formulations, when dealing with constraints which tend to actually show O(n + m + nm + nm(2) + m(3)) performance. Additionally, these latter formulations may require additional constraint violation stabilization procedures (e. g. Baumgarte's method, coordinate partitioning, etc.) which can contribute significant additional computation. The presented method suffers less from this difficulty because the loop closure constraints at both the velocity and acceleration level are directly embedded within the formulation. Due to these characteristics, the presented algorithm offers superior computing performance relative to other methods in situations involving both large n and m.

关键词： recursive algorithm constrained system coordinate reduction

来源：评论

学校读者我要写书评

暂无评论

Nonlinear phenomena in spaces of algorithms

引用

INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS 2003年第12期80卷 1449-1476页

作者： Burgin, M Univ Calif Los Angeles Dept Math Los Angeles CA 90095 USA

Nonlinear phenomena, which are so important in nature and society, are considered here in relation to the world of algorithms and computations. To have a mathematical model for this world, formal computability spaces are introduced. It is demonstrated that the traditional approach to algorithms, which is based on such popular models as Turing machines, results in linear subspaces of the computability space. Nonlinear phenomena appear when we go to the more powerful class of such super-recursive algorithms as inductive Turing machines. It is demonstrated how this nonlinearity imports much higher computing power of inductive Turing machines in comparison with conventional Turing machines. This provides a base to consider problems of chaos, emergent computations and infinity from the algorithmic point of view.

关键词： emerging computation recursive algorithm super-recursive algorithm arithmetical hierarchy computability space chaos inductive Turing machine

来源：评论

学校读者我要写书评

暂无评论

Propagator-based methods for recursive subspace model identification

引用

SIGNAL PROCESSING 2008年第3期88卷 468-491页

作者： Mercere, Guillaume Bako, Laurent Lecoeuche, Stephane Univ Poitiers Lab Automat & Informat Ind EA 1219 F-86022 Poitiers France Ecole Mines Douai Dept Informat & Automat F-59508 Douai France CNRS UMR 8146 Lab Automat Genie Informat & Signal F-59651 Villeneuve Dascq France

The problem of the online identification of multi-input multi-output (MIMO) state-space models in the framework of discrete-time subspace methods is considered in this paper. Several algorithms, based on a recursive formulation of the MIMO Output Error State-Space (MOESP) identification class, are developed. The main goals of the proposed methods are to circumvent the huge complexity of eigenvalues or singular values decomposition techniques used by the offline algorithm and to provide consistent state-space matrices estimates in a noisy framework. The underlying principle consists in using the relationship between array signal processing and subspace identification to adjust the propagator method (originally developed in array signal processing) to track the subspace spanned by the observability matrix. The problem of the (coloured) disturbances acting on the system is solved by introducing an instrumental variable in the minimized cost functions. A particular attention is paid to the algorithmic development and to the computational cost. The benefits of these algorithms in comparison with existing methods are emphasized with a simulation study in time-invariant and timevarying scenarios. (C) 2007 Elsevier B.V. All rights reserved.

关键词： system identification recursive algorithm subspace method instrumental variable multivariable system

来源：评论

学校读者我要写书评

暂无评论

Reliability evaluation of non-repairable phased-mission common bus systems with common cause failures

引用

COMPUTERS & INDUSTRIAL ENGINEERING 2017年 111卷 445-457页

作者： Yu, Huan Yang, Jun Lin, Jing Zhao, Yu Beihang Univ Sch Reliabil & Syst Engn Beijing 100191 Peoples R China Lulea Univ Technol Div Operat & Maintenance Engn S-97187 Lulea Sweden

Phased-mission common bus (PMCB) systems are systems with a common bus structure, performing missions with consecutive and non-overlapping phases of operations. PMCB systems are found throughout industry, e.g., power generating systems, parallel computing systems, transportation systems, and are sometimes characterized by their common cause failures. Reliability evaluation of PMCB systems plays an important role in system design, operation, and maintenance. However, current studies have focused on either phased-mission systems or common bus systems because of their complexity. The challenge in practice is to consider phased-mission systems together with common bus structures and common cause failures. To solve this problem, we propose an evaluation algorithm for PMCB systems with common cause failures by coupling the structure function of a common bus performance sharing system and an existing recursive algorithm. To weigh the efficiency of the proposed algorithm, its complexity is discussed. To improve the reliability of PMCB systems, we adopt the genetic algorithm method to search for the optimal allocation strategies of the service elements. We use both analytical and numerical examples to illustrate the application of the proposed algorithm. (C) 2017 Elsevier Ltd. All rights reserved.

关键词： Reliability evaluation Phased-mission systems Common bus performance sharing recursive algorithm Genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：