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

A simple recursive algorithm for simultaneous magnitude and frequency estimation

IEEE TRANSACTIONS ON INSTRUMENTATION AND MEASUREMENT 2008年第6期57卷 1207-1214页

作者： Kusljevic, Miodrag D. Termoelektro Enel AD Belgrade 11060 Serbia

A new approach in the design of digital algorithms for simultaneous local system magnitude and frequency estimation of a signal with time-varying frequency is presented. The algorithm is derived using the maximum likelihood method. The pure sinusoidal voltage model was assumed. The investigation has been simplified because the total similarity to the state of the problem of de offset and frequency estimation has been noticed. Finite impulse response (FIR) digital filters are used to minimize the noise effect and to eliminate the presence of harmonic effects. The algorithm showed a very high level of robustness, as well as high measurement accuracy over a wide range of frequency changes. The algorithm convergence provided fast response and adaptability. This technique provides accurate estimates in about 25 ms and requires modest computations. The theoretical bases of the technique are described. To demonstrate the performance of the developed algorithm, computer-simulated data records are processed. The proposed algorithm has been tested in a laboratory to establish its feasibility in a real-time environment.

关键词： computer relaying frequency measurement magnitude measurement maximum likelihood method (MLM) parameter estimation recursive algorithm

来源：评论

学校读者我要写书评

暂无评论

A fast recursive algorithm for constructing matrices with prescribed eigenvalues and singular values

引用

SIAM JOURNAL ON NUMERICAL ANALYSIS 2000年第3期37卷 1004-1020页

作者： Chu, MT N Carolina State Univ Dept Math Raleigh NC 27695 USA

The Weyl-Horn theorem characterizes a relationship between the eigenvalues and the singular values of an arbitrary matrix. Based on that characterization, a fast recursive algorithm is developed to construct numerically a matrix with prescribed eigenvalues and singular values. Besides being of theoretical interest, the technique could be employed to create test matrices with desired spectral features. Numerical experiment shows this algorithm to be quite efficient and robust.

关键词： eigenvalues singular values inverse problems Weyl-Horn theorem recursive algorithm

来源：评论

学校读者我要写书评

暂无评论

New recursive algorithm for matrix inversion

引用

Journal of Systems Engineering and Electronics 2008年第2期19卷 381-384页

作者： Cao Jianshu Wang Xuegang Coll. of Electronic Engineering Univ. of Electronic Science and Technology of China Chengdu 610054 P. R. China

To reduce the computational complexity of matrix inversion, which is the majority of processing in many practical applications, two numerically efficient recursive algorithms （called algorithms I and II, respectively） are presented. algorithm I is used to calculate the inverse of such a matrix, whose leading principal minors are all nonzero. algorithm II, whereby, the inverse of an arbitrary nonsingular matrix can be evaluated is derived via improving the algorithm I. The implementation, for algorithm II or I, involves matrix-vector multiplications and vector outer products. These operations are computationally fast and highly parallelizable. MATLAB simulations show that both recursive algorithms are valid.

关键词： recursive algorithm matrix inversion matrix-vector product leading principal minor (LPM).

来源：评论

学校读者我要写书评

暂无评论

recursive algorithm For Simulation Of Single Chain Manipulator Dynamics 10

Recursive Algorithm For Simulation Of Single Chain Manipulat...

引用

IEEE/ASME 10th International Conference on Mechatronic and Embedded Systems and Applications (MESA)

作者： Yaskevich, Nikita Bauman Moscow State Tech Univ Special Robot & Mechatron Dept Moscow Russia

ISBN: (纸本)9781479922802

A new recursive algorithm based on Kane equations matrix form for closed form dynamics equations calculation for simple kinematical chain is presented. It has computational cost proportional to the third degree of bodies number O(n(3)) and is used for motion simulation for manipulators with rotary joints. This algorithm allows to consider links flexibility by using finite elements as rigid bodies and to use parallel calculations. The proposed recursive algorithm has higher efficiency than the original Kane equations algorithm.

关键词： space manipulator dynamics equations recursive algorithm computational efficiency elastic deformation

来源：评论

学校读者我要写书评

暂无评论

CONVERGENCE OF DIRECT recursive algorithm FOR IDENTIFICATION OF PREISACH HYSTERESIS MODEL WITH STOCHASTIC INPUT

引用

SIAM JOURNAL ON APPLIED MATHEMATICS 2016年第4期76卷 1270-1295页

作者： Rachinskii, D. Ruderman, M. Univ Texas Dallas Dept Math Sci Richardson TX 75080 USA Univ Agder Fac Sci & Engn Grimstad Norway

We consider a recursive iterative algorithm for identification of parameters of the Preisach model, one of the most commonly used models of hysteretic input-output relationships. This online algorithm uses a simple rule for updating the values of the piecewise constant density function in the switching region at each time step. The so-called persistent excitation condition has been shown to play an important role for convergence of recursive iteration schemes when input-output data are generated by a deterministic input (such as, for example, a periodically repeated sequence of test inputs prescribed by the classical Mayergoyz identification algorithm). In this work, we assume that the input randomly fluctuates and these fluctuations can be described by a stochastic Markov process. Assuming that accurate measurements of the input and output are available, we prove the exponential convergence of the recursive identification algorithm, estimate explicitly the convergence rate, and explore which properties of the stochastic input and the algorithm affect the guaranteed convergence rate. An analogue of the persistent excitation condition suitable for analysis of stochastic Markov inputs is established. Numerical examples that test the convergence of the algorithm in the case of a time-dependent density function and in the presence of measurement noise are presented.

关键词： identification problem recursive algorithm exponential convergence rate model of hysteresis input-output operator stochastic input

来源：评论

学校读者我要写书评

暂无评论

Time-varying modal parameters identification of a spacecraft with rotating flexible appendage by recursive algorithm

引用

ACTA ASTRONAUTICA 2016年第Jan./Feb.期118卷 49-61页

作者： Ni, Zhiyu Mu, Ruinan Xun, Guangbin Wu, Zhigang Dalian Univ Technol State Key Lab Struct Anal Ind Equipment Dalian Peoples R China Dalian Univ Technol Dept Mech Engn Dalian Peoples R China Dalian Univ Technol Sch Aeronaut & Astronaut Dalian Peoples R China

The rotation of spacecraft flexible appendage may cause changes in modal parameters. For this time-varying system, the computation cost of the frequently-used singular value decomposition (SVD) identification method is high. Some control problems, such as the self-adaptive control, need the latest modal parameters to update the controller parameters in time. In this paper, the projection approximation subspace tracking (PAST) recursive algorithm is applied as an alternative method to identify the time-varying modal parameters. This method avoids the SVD by signal subspace projection and improves the computational efficiency. To verify the ability of this recursive algorithm in spacecraft modal parameters identification, a spacecraft model with rapid rotational appendage, Soil Moisture Active/Passive (SMAP) satellite, is established, and the time-varying modal parameters of the satellite are identified recursively by designing the input and output signals. The results illustrate that this recursive algorithm can obtain the modal parameters in the high signal noise ratio (SNR) and it has better computational efficiency than the SVD method. Moreover, to improve the identification precision of this recursive algorithm in the low SNR, the wavelet de-noising technology is used to decrease the effect of noises. (C) 2015 IAA. Published by Elsevier Ltd. All rights reserved.

关键词： Modal parameter identification Time-varying system Rotating flexible appendage recursive algorithm Spacecraft

来源：评论

学校读者我要写书评

暂无评论

A recursive algorithm for Determining the Profile of the Spatial Self-anchored Suspension Bridges

引用

KSCE JOURNAL OF CIVIL ENGINEERING 2019年第3期23卷 1283-1292页

作者： Li, Tao Liu, Zhao Southeast Univ Sch Civil Engn Nanjing 31470 Jiangsu Peoples R China

Determining the final state of a suspension bridge involves the optimization problem to obtain the cable tensions which can balance the dead load. For the long-span suspension bridges, the optimization problem is complex because there can be hundreds of variables to identify in this process. In present work, the simultaneous equations describing the equilibrium state of the cable system are set up. With the proposed recursive algorithm, these equations, which shall include a number of unknown variables, are simplified into a concise form in which exist only three unknowns. On this basis, the coupled three nonlinear equations are solved by the proposed method of the Interacting Influence Matrix (IIM) optimization. After solving the coupled equation, all the unknown parameters including the tensions and positions of the cables can be determined analytically. Last, an example is used to demonstrate the correctness and effectiveness of the proposed processes.

关键词： recursive algorithm self-anchored suspension bridge spatial cable IIM optimization unstrained length

来源：评论

学校读者我要写书评

暂无评论

A recursive algorithm for the rectangular guillotine strip packing problem

引用

ENGINEERING OPTIMIZATION 2008年第4期40卷 347-360页

作者： Cui, Y. Gu, T. Zhong, Y. Guangxi Normal Univ Dept Comp Sci Guilin 541004 Peoples R China Guilin Univ Elect Technol Dept Comp Sci Guilin 541004 Peoples R China

This article presents a recursive heuristic algorithm to generate cutting patterns for the rectangular guillotine strip packing problem in which a set of rectangular items must be cut from the strip such that the consumed strip length is minimized. The strip is placed with its length along the horizontal direction, and is divided into several segments with vertical cuts. The length of a segment is determined by the item placed at the bottom. Orthogonal cuts divide the segments into blocks and finished items. For the current block considered, the algorithm selects an item, puts it at the bottom-left corner of the block, and divides the unoccupied region into two smaller blocks with an orthogonal cut. Rotation of the items by 90 is allowed. Both lower and upper bounds are used to prune unpromising branches. The computational results indicate that the algorithm performs better than several recently published algorithms.

关键词： strip packing cutting stock recursive algorithm branch and bound

来源：评论

学校读者我要写书评

暂无评论

A fast recursive algorithm based on fuzzy 2-partition entropy approach for threshold selection

引用

NEUROCOMPUTING 2011年第17期74卷 3072-3078页

作者： Tang, Yinggan Mu, Weiwei Zhang, Ying Zhang, Xuguang Beijing Univ Posts & Telecommun State Key Lab Networking & Switching Technol Beijing 100876 Peoples R China Yanshan Univ Inst Elect Engn Qinhuangdao 066004 Hebei Peoples R China Natl Lighting Test Ctr Beijing 100022 Peoples R China

The fuzzy c-partition entropy approach for threshold selection is an effective approach for image segmentation. The approach models the image with a fuzzy c-partition, which is obtained using parameterized membership functions. The ideal threshold is determined by searching an optimal parameter combination of the membership functions such that the entropy of the fuzzy c-partition is maximized. It involves large computation when the number of parameters needed to determine the membership function increases. In this paper, a recursive algorithm is proposed for fuzzy 2-partition entropy method, where the membership function is selected as S-function and Z-function with three parameters. The proposed recursive algorithm eliminates many repeated computations, thereby reducing the computation complexity significantly. The proposed method is tested using several real images, and its processing time is compared with those of basic exhaustive algorithm, genetic algorithm (GA), particle swarm optimization (PSO), ant colony optimization (ACO) and simulated annealing (SA). Experimental results show that the proposed method is more effective than basic exhaustive search algorithm, GA, PSO, ACO and SA. Crown Copyright (C) 2011 Published by Elsevier B.V. All rights reserved.

关键词： Image segmentation Fuzzy c-partition Thresholding recursive algorithm Entropy

来源：评论

学校读者我要写书评

暂无评论

Bayesian reasoning approach based recursive algorithm for online updating belief rule based expert system of pipeline leak detection

引用

EXPERT SYSTEMS WITH APPLICATIONS 2011年第4期38卷 3937-3943页

作者： Zhou, Zhi-Jie Hu, Chang-Hua Xu, Dong-Ling Yang, Jian-Bo Zhou, Dong-Hua Tsinghua Univ Dept Automat TNList Beijing 100084 Peoples R China High Tech Inst Xian Xian 710025 Shaanxi Peoples R China Univ Manchester Manchester Business Sch Manchester M15 6PB Lancs England

In this paper a recursive algorithm based on the Bayesian reasoning approach is proposed to update a belief rule based (BRB) expert system for pipeline leak detection and leak size estimation. In addition to using available real time data, expert knowledge on the relationships of the parameters among different rules is incorporated into the updating process so that the performance of the expert system can be improved. Experiments are carried out to compare the newly proposed algorithm with the previously published algorithms, and results show that the proposed algorithm can update the BRB expert system faster and more accurately, which is important for real-time applications. The BRB expert systems can be automatically tuned to represent complex real world systems, and applied widely in engineering. (C) 2010 Elsevier Ltd. All rights reserved.

关键词： Belief rule base Expert system Bayesian reasoning recursive algorithm Leak detection

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：