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

IDENTIFICATION OF A STATE SPACE MODEL FOR A SYNCHRONOUS MACHINE

IFAC Proceedings Volumes 2005年第1期38卷 262-267页

作者： Bin Wu Peng Zhao Om Malik Department of Electrical and Computer Engineering University of Calgary Calgary Alberta Canada T2N 1N4

Application of a recursive subspace identification method to derive a state space model for a synchronous machine is described in this paper. Simulation studies show the effectiveness of such an algorithm to identify on-line a synchronous machine model over a wide range of operating conditions and disturbances. The model provides a foundation for further study on a MIMO adaptive power system stabilizer.

关键词： Synchronous machines State-space models recursive algorithms MIMO

来源：评论

学校读者我要写书评

暂无评论

SEQUENTIAL CORRELATION BASED PROPAGATOR ALGORITHM FOR recursive SUBSPACE IDENTIFICATION

引用

IFAC Proceedings Volumes 2005年第1期38卷 922-927页

作者： Guillaume Mercère Stéphane Lecœuche Christian Vasseur Laboratoire LAGIS – Bâtiment P2 USTL – 59655 Villeneuve d'Ascq Cedex – France EIPC Campus de la Malassise – BP39 – 62967 Longuenesse Cedex-France Ecole des Mines de Douai – Rue Charles Bourseul – BP 838 – 59508 Douai Cedex-France

The problem of the recursive identification of MIMO state space models in the framework of subspace methods is considered in this article. Two new algorithms, based on a recursive formulation of the MOESP identification class, are more precisely developed. The specific feature of these methods is that they share a single algorithm to recursively estimate a basis of the observability matrix. Two propagator based (Murder and Delisle, 1991) criteria are introduced. A sequential RLS algorithm is proposed to equally minimise these cost functions. The benefits of these new techniques in comparison with EIVPAST and UDPAST (Lovera et al. , 2000) are emphasized with a simulation example.

关键词： Identification algorithms recursive algorithms subspace methods state-space models recursive least squares

来源：评论

学校读者我要写书评

暂无评论

On Pell partitions

引用

FIBONACCI QUARTERLY 2004年第4期42卷 348-352页

作者： Knopfmacher, A Robbins, N Univ Witwatersrand John Knopfmacher Ctr Applicable Anal & Number The Johannesburg South Africa San Francisco State Univ Dept Math San Francisco CA 94132 USA

Let Un denote the number of partitions of the natural number n, all of whose parts bi to {P-n,}- In this note, we present a recursive algorithm for computing Un. The techn used here are also applicable to other second order linear recurrences that have the pro] of being super-increasing, that is, where each term exceeds the sum of all its predecessoi [1], the second author solved the corresponding problem for the Fibonacci sequence.

关键词： Fibonacci sequence recursive algorithms partitions Denote Proline Writers PART Relapse Note Taking Natural number bismuth

来源：评论

学校读者我要写书评

暂无评论

On the contraction method with degenerate limit equation

引用

ANNALS OF PROBABILITY 2004年第3B期32卷 2838-2856页

作者： Neininger, R Rüschendorf, L Univ Frankfurt Dept Math D-60325 Frankfurt Germany Univ Freiburg Inst Math Stochast D-79104 Freiburg Germany

A class of random recursive sequences (Y-n) with slowly varying variances as arising for parameters of random trees or recursive algorithms X leads after normalizations to degenerate limit equations of the form X =(L) X. For nondegenerate limit equations the contraction method is a main tool to establish convergence of the scaled sequence to the "unique" solution of the limit equation. In this paper we develop an extension of the contraction method which allows us to derive limit theorems for parameters of algorithms and data structures with degenerate limit equation. In particular, we establish some new tools and a general convergence scheme, which transfers information on mean and variance into a central limit law (with normal limit). We also obtain a convergence rate result. For the proof we use selfdecomposability properties of the limit normal distribution which allow us to mimic the recursive sequence by an accompanying sequence in normal variables.

关键词： contraction method analysis of algorithms recurrence recursive algorithms divide-and-conquer algorithm random recursive structures Zolotarev metric

来源：评论

学校读者我要写书评

暂无评论

Nonlinear Adaptive Control of Systems in Feedback Form: An Alternative to Adaptive Backstepping

引用

IFAC Proceedings Volumes 2004年第11期37卷 67-72页

作者： Dimitrios Karagiannis Alessandro Astolfi Department of Electrical and Electronic Engineering Imperial College London SW7 2BT United Kingdom Tel: + 44 20 7594 6289 Fax.: +44 20 7594 6282.

In this paper we propose a new recursive algorithm for the regulation via state feedback of systems in so-called parametric feedback form. The algorithm resembles the well-known adaptive backstepping approach, but differs in the way the parameter estimator is constructed and in the way the nonlinear gains are assigned. A comparative case study is presented, highlighting the advantages of the proposed methodology.

关键词： Nonlinear systems adaptive control parameter estimation recursive algorithms feedback linearization

来源：评论

学校读者我要写书评

暂无评论

Mixed time scale recursive algorithms

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 2001年第8期49卷 1824-1830页

作者： Bucklew, JA Kurtz, TG Univ Wisconsin Dept Elect & Comp Engn Madison WI 53706 USA Univ Wisconsin Dept Math Madison WI 53706 USA

In this paper, we investigate the behavior of certain types of mixed time scale adaptive algorithms. These systems comprise a "fast" or quickly changing algorithm mutually coupled to a "slow" or slowly changing algorithm, They arise naturally in a variety of adaptive environments such as in IIR system identification, the training of recurrent neural networks, decision feedback equalization, and others. [These algorithms (despite their title) should not be confused with the mixed time scales of wavelet transforms or other algorithms associated with multiresolution signal processing.] We give conditions for when the system can be analyzed from the framework of a simpler "frozen state" system, This analysis extends some of the previous work of Solo and his coworkers.

关键词： mixed time scales nonlinear signal processing algorithms recursive algorithms

来源：评论

学校读者我要写书评

暂无评论

The contraction method for recursive algorithms

引用

ALGORITHMICA 2001年第1-2期29卷 3-33页

作者： Rösler, U Rüschendorf, L Univ Kiel D-24118 Kiel Germany Univ Freiburg D-79104 Freiburg Germany

In this paper we give an introduction to the analysis of algorithms by the contraction method. By means of this method several interesting classes of recursions can be analyzed as particular cases of our general framework. We introduce the main steps of this technique which is based on contraction properties of the algorithm with respect to suitable probability metrics. Typically the limiting distribution is characterized as a fixed point of a limiting operator on the class of probability distributions. We explain this method in the context of several "divide and conquer" algorithms. In the second part of the paper we introduce a new quite general model for branching dynamical systems and explain that the contraction method can be applied in this model. This model includes many classical examples of random trees and gives a general frame for further applications.

关键词： recursive algorithms contraction method branching dynamical systems random trees branching process

来源：评论

学校读者我要写书评

暂无评论

recursive dual-linear-programming approach for parameter-uncertainty-interval estimation

引用

IEE PROCEEDINGS-CONTROL THEORY AND APPLICATIONS 2003年第3期150卷 303-310页

作者： Sun, XF Zhang, HY Fan, YZ Beijing Univ Aeronaut & Astronaut Sch Automat Sci & Elect Engn Beijing 100083 Peoples R China

The parameter-uncertainty-interval-estimation (PIE) problem is transferred into several dual-linear-programming (DLP) problems, and a recursive DLP algorithm is proposed and applied in PIE. This recursive algorithm is based on a modified dual-simplex method that is specifically developed for solving the DLP problems derived from the PIE problem. Because the scale of the DLP problems is considerably smaller than that of the primal linear-programming problems for solving the PIE problem, the recursive DLP algorithm is computationally efficient and suitable for online-engineering applications. Simulations show the effectiveness of the proposed recursive algorithm.

关键词： recursive algorithms project independence evaluation system Simplex method

来源：评论

学校读者我要写书评

暂无评论

Improved recursive Newton-type algorithm for frequency and spectra estimation in power systems

引用

IEEE TRANSACTIONS ON INSTRUMENTATION AND MEASUREMENT 2003年第5期52卷 1654-1659页

作者： Terzija, VV ABB Calor Emag Mittelspannung GmbH Ratingen Germany

In this paper, a new improved recursive Newton-type algorithm suitable for various measurement applications in electric power systems is presented. It is used for the power system frequency and spectra estimation. The recursive algorithm form is improved with a strategy of sequential tuning of the forgetting factor. By this, the algorithm convergence and accuracy are significantly improved. To show the main algorithm features, the results of computer simulation, laboratory testing (load rejection and unsuccessful symchronization tests) and field data processing are given.

关键词： computer simulation field testing frequency laboratory testing measurement nonlinear estimation power systems recursive algorithms spectrum

来源：评论

学校读者我要写书评

暂无评论

On some techniques for streaming data: A case study of Internet packet headers

引用

JOURNAL OF COMPUTATIONAL AND GRAPHICAL STATISTICS 2003年第4期12卷 893-914页

作者： Wegman, EJ Marchette, DJ George Mason Univ Ctr Computat Stat Fairfax VA 22030 USA USN Ctr Surface Warfare Dahlgren VA 22448 USA

We consider the implications of streaming data for data analysis and data mining. Streaming data are becoming widely available from a variety of sources. In our case we consider the implications arising from Internet traffic data. By implication, streaming data are unlikely to be time homogeneous so that standard statistical and data mining procedures do not necessarily apply. Because it is essentially impossible to store streaming data, we consider recursive algorithms, algorithms which are adaptive and discount the past and also algorithms that create finite pseudo-samples. We also suggest some evolutionary graphics procedures that are suitable for streaming data. We begin our discussion with a discussion of Internet traffic in order to give the reader some sense of the time and data scale and visual resolution needed for such problems.

关键词： evolutionary graphics exponential smoothing mixture models recursive algorithms recursive density estimation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：