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

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

来源：评论

学校读者我要写书评

暂无评论

Identification of Time-varying Frequencies and Model Parameters for Large Flexible On-orbit Satellites Using a recursive algorithm

引用

TRANSACTIONS OF THE JAPAN SOCIETY FOR AERONAUTICAL AND SPACE SCIENCES 2016年第3期59卷 150-160页

作者： Ni, Zhiyu Tan, Shujun Wu, Zhigang Dalian Univ Technol State Key Lab Struct Anal Ind Equipment Dalian 116024 Peoples R China Dalian Univ Technol Sch Aeronaut & Astronaut Dalian 116024 Peoples R China

Today, the primary identification methods in time domain for spacecraft are based on singular value decomposition (SVD), such as the eigensystem realization algorithm (ERA) or stochastic subspace identification (SSI), which requires significant computation time. However, some control problems, such as self-adaptive control, need the latest modal parameters to update controller parameters online. To improve computational efficiency, the fast approximated power iteration (FAPI) recursive algorithm, which avoids SVD, is applied as an alternative method to identify the time-varying frequencies of large flexible satellites. Moreover, an improved recursive form is also proposed to obtain the time-varying input matrix in a state-space model by rewriting the relation of the input and output data. In numerical simulations, the time-varying model of the Engineering Test Satellite-VIII (ETS-VIII) is established. The results illustrate that this recursive algorithm can implement time-varying parameter online identification and it has a better computational efficiency than the SVD-based methods.

关键词： On-orbit Identification Time-varying Modal Parameters Large Flexible Satellite recursive algorithm State-space Model

来源：评论

学校读者我要写书评

暂无评论

A recursive algorithm for Generalized Constraint SCS Problem

引用

NATIONAL ACADEMY SCIENCE LETTERS-INDIA 2016年第4期39卷 273-276页

作者： Mangal, Kaish Kumar, Ravinder Nagarro Software Pvt Ltd New Delhi India Thapar Univ Dept Comp Sci & Engn Patiala Punjab India

In this paper a constraint shortest common supersequence problem, i.e. the string including constraint shortest common supersequence problem was considered. Shortest common supersequence is known as classical problem in the area of strings and it is classified as NP-hard problem. For two input DNA sequences X and Y of length m and n respectively and the constraint DNA sequence P of length r, and the problem was to compute the shortest common supersequence of string X and Y including P as substring and the length of SCS must be minimum. Chen and Chao (J Comb Optim 21: 383-392, 2011) proposed the same problem but with constraint as longest common subsequence and its solution in 2011. A recursive procedure for STR-IC-SCS problem was proposed.

关键词： Longest common subsequence (LCS) Shortest common supersequence (SCS) recursive algorithm NP hard Patterns by LCS and SCS (PALS)

来源：评论

学校读者我要写书评

暂无评论

Analysis of singular systems via Taylor series using a recursive algorithm 1

Analysis of singular systems via Taylor series using a recur...

引用

1st IEEE International Conference on Control, Measurement and Instrumentation (CMI)

作者： Ghosh, Suchismita MCKV Inst Engn Dept Elect Engn Howrah India

ISBN: (纸本)9781479917693

The paper proposes a new recursive approach for the analysis of singular system using Taylor series. Firstly, theoretical foundation of the recursive algorithm using both first and second orders Taylor series has been established in a lucid manner. Numerical examples have been treated along with relevant tables and curves in support of effectiveness of the method. Further, mean integral square error (MISE) has been estimated for both first and second order Taylor series approaches and found to be within tolerable limits. Thus, the method proves to be attractive and efficient as well.

关键词： singular system Taylor series recursive algorithm

来源：评论

学校读者我要写书评

暂无评论

recursive algorithm Based Reliability Analysis of Multiphase Satellite Systems with Propagated Failures

引用

Journal of Donghua University(English Edition) 2015年第1期32卷 136-139页

作者：周行于乐彭伟彭卫文黄洪钟 School of Mechanic Electronic and Industrial EngineeringUniversity of Electronic Science and Technology of China

Modern satellite systems are generally designed to fulfill multiphase-missions. Component /subsystem redundancies are commonly used to achieve high reliability and long life of modern satellite systems. These characteristics have leaded to a critical issue of reliability analysis of satellites that is how to deal with the reliability analysis with multiphase-missions and propagated failures of redundant components. Traditional methods based on the binary decision diagram( BDD) can hardly cope with these issues efficiently. Accordingly, a recursive algorithm method was introduced to facilitate the reliability analysis of satellites. This method was specified for the analysis of static fault tree and it was implemented by generating combination of component failures and carrying out a backward recursive algorithm. The effectiveness of the proposed method was demonstrated through the reliability analysis of a multiphase satellite system with propagated *** major advantage of the proposed method is that it does not need composition of BDD and its computational process is automated.

关键词： satellite reliability recursive algorithm multiphase system(MPS) propagated failures reliability analysis

来源：评论

学校读者我要写书评

暂无评论

A modified recursive transfer matrix algorithm for radiation and scattering computation of a multilayered sphere

引用

JOURNAL OF QUANTITATIVE SPECTROSCOPY & RADIATIVE TRANSFER 2025年 338卷

作者： Zhang, Jianing Northeastern Univ Natl Frontiers Sci Ctr Ind Intelligence & Syst Opt Shenyang 110819 Peoples R China Northeastern Univ Coll Informat Sci & Engn Shenyang 110819 Peoples R China

We discuss the electromagnetic scattering and radiation problems of multilayered spheres, reviewing the history of the Lorentz-Mie theory and the numerical stability issues encountered in handling multilayered spheres. By combining recursive methods with the transfer matrix method, we propose a modified transfer matrix algorithm designed for the stable and efficient calculation of electromagnetic scattering coefficients of multilayered spheres. The new algorithm simplifies the recursive formulas by introducing Debye potentials and logarithmic derivatives, effectively avoiding numerical overflow issues associated with Bessel functions under large complex variables. Moreover, by adopting a hybrid recursive strategy, this algorithm can resolve the singularity problem associated with logarithmic derivatives in previous algorithms. Numerical test results demonstrate that this algorithm offers superior stability and applicability when dealing with complex cases such as thin shells and strongly absorbing media.

关键词： Transfer matrix method recursive algorithm Multilayered sphere Lorenz-Mie theory

来源：评论

学校读者我要写书评

暂无评论

Analysis of singular systems via Taylor series using a recursive algorithm

Analysis of singular systems via Taylor series using a recur...

引用

IEEE International Conference on Control, Measurement and Instrumentation

作者： Suchismita Ghosh Department of Electrical Engineering MCKV Institute of Engineering

ISBN: (纸本)9781479988501

关键词： Singular system Taylor series recursive algorithm

来源：评论

学校读者我要写书评

暂无评论

A sequential optimal Latin hypercube design method using an efficient recursive permutation evolution algorithm

引用

ENGINEERING OPTIMIZATION 2024年第2期56卷 179-198页

作者： Li, Guosheng Yang, Jiawei Wu, Zeping Zhang, Weihua Okolo, Patrick Zhang, Dequan Natl Univ Def Technol Coll Aerosp Sci & Engn Changsha Peoples R China Oxford Brookes Univ Fac Technol Design & Environm Mech Engn & Math Sci Oxford England Hebei Univ Technol Sch Mech Engn State Key Lab Reliabil & Intelligence Elect Equipm Tianjin Peoples R China

Latin hypercube design (LHD) is one of the most frequently used sampling methods. However, most LHDs generate data samples in a manner that hinders computational efficiency and space-filling performance when high dimensions and large samples are involved. Therefore, a sequential recursive evolution Latin hypercube design (RELHD) is proposed in this article, which adopts a permutation inheritance algorithm to update and optimize the LHD. A recursive split algorithm is also proposed and used to enhance the computational efficiency by dividing the sample set into smaller subsets. Numerical experiments demonstrate that the space-filling quality of the RELHD compares well with the enhanced stochastic evolutionary algorithm (ESE) in complex problems with large samples and high dimensions, with RELHD having a significantly higher computational efficiency than ESE. Finally, the sequential approach of RELHD proves to be a more efficient strategy when dealing with sampling-based analysis problems.

关键词： Design of experiments optimal Latin hypercube design permutation information inheritance sequential evolution recursive algorithm

来源：评论

学校读者我要写书评

暂无评论

A recursive Attribute Reduction algorithm and Its Application in Predicting the Hot Metal Silicon Content in Blast Furnaces

引用

BIG DATA AND COGNITIVE COMPUTING 2025年第1期9卷 6-6页

作者： Li, Zhanqi Cheng, Pan Yin, Linzi Guan, Yuyin Cent South Univ Sch Elect Informat Changsha 410083 Peoples R China

For many complex industrial applications, traditional attribute reduction algorithms are often inefficient in obtaining optimal reducts that align with mechanistic analyses and practical production requirements. To solve this problem, we propose a recursive attribute reduction algorithm that calculates the optimal reduct. First, we present the notion of priority sequence to describe the background meaning of attributes and evaluate the optimal reduct. Next, we define a necessary element set to identify the "individually necessary" characteristics of the attributes. On this basis, a recursive algorithm is proposed to calculate the optimal reduct. Its boundary logic is guided by the conflict between the necessary element set and the core attribute set. The experiments demonstrate the proposed algorithm's uniqueness and its ability to enhance the prediction accuracy of the hot metal silicon content in blast furnaces.

关键词： attribute reduction priority sequence recursive algorithm silicon content

来源：评论

学校读者我要写书评

暂无评论

A novel recursive algorithm for the calculation of the detailed identity coefficients

引用

GENETICS SELECTION EVOLUTION 2015年第1期47卷 1-4页

作者： Garcia-Cortes, Luis Alberto Inst Nacl Invest Agr Dept Mejora Genet Madrid 28040 Spain

Background: A recursive algorithm to calculate the fifteen detailed coefficients of identity is introduced. Previous recursive procedures based on the generalized coefficients of kinship provided the detailed coefficients of identity under the assumption that the two individuals were not an ancestor of each other. Findings: By using gametic relationships to include three, four or two pairs of gametes, we can obtain these coefficients for any pair of individuals. We have developed a novel linear transformation that allows for the calculation of pairwise detailed identity coefficients for any pedigree given the gametic relationships. We illustrate the procedure using the well-known pedigree of Julio and Mencha, which contains 20 Jicaque Indians of Honduras, to calculate their detailed coefficients. Conclusions: The proposed algorithm can be used to calculate the detailed identity coefficients of two or more individuals with any pedigree relationship.

关键词： recursive Formula recursive Function recursive algorithm Detailed Coefficient Kinship Coefficient

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：