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

Real-time simulation of power electronic systems based on step-size adaptive algorithm

ELECTRIC POWER SYSTEMS RESEARCH 2025年 246卷

作者： Yu, Zhijian Yin, Quan Chen, Guoyong Wang, Guangsen Huazhong Univ Sci & Technol Sch Artificial Intelligence & Automat Wuhan 430073 Peoples R China Naval Univ Engn Natl Key Lab Electromagnet Energy Wuhan 430033 Peoples R China

In a real-time power system simulation, it is essential to output data strictly at equally spaced sampling points. Therefore, accurate synchronization of data exchanges between the target machine and external devices is critical. When switching events occur between these sampling points, the trigger time for the event is typically delayed to the next available sampling point. This issue can reduce the accuracy of the simulation. interpolation methods are commonly employed for asynchronous switching events to mitigate this issue. However, iterative computations following interpolation always introduce a temporal offset relative to the sampling points, and additional interpolation is needed to resynchronize the simulation results. To address this problem, this paper proposes a step-size adaptive algorithm that dynamically adjusts the integration step size to ensure that simulation results are accurately output at sampling points. Unlike traditional numerical integration methods, which necessitate frequent recalculations of the admittance matrix during variable step-size computations, the proposed algorithm introduces a parameter adapting to the step size. Our approach allows the admittance matrix to remain unchanged and significantly reduce computational overhead. Simulation experiments validate that the proposed algorithm achieves high accuracy and stability in variable step-size integration while effectively suppressing numerical oscillations in non-state variables caused by switching events.

关键词： Resynchronization Power electronic switch Real-time simulation interpolation algorithm Reinitialization

来源：评论

学校读者我要写书评

暂无评论

Double NURBS trajectory generation and synchronous interpolation for five-axis machining based on dual quaternion algorithm

引用

INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY 2016年第9-12期83卷 2015-2025页

作者： Zhang, Jun Zhang, Liqiang Zhang, Kai Mao, Jian Shanghai Univ Engn Sci Coll Mech Engn Shanghai 201620 Peoples R China

An equidistant double NURBS tool paths (EDNTP) fairing method satisfying the given fitting accuracy is proposed for the linear tool path in work coordinate system (WCS). By utilizing dual-quaternion to describe five-axis tool posture, the linear tool path in WCS is fitted with dual-quaternion B-spline vector function in order to obtain the equidistant double NURBS curves P and Q describing the coordinate points of tool tip and tool axis, respectively. Then, due to the different parameters of the two curves, a parameter synchronization interpolation model based on EDNTP is presented to realize synchronous motion of the two NURBS curve parameters during the interpolation process. The three-axis machining NURBS curve interpolation algorithm is utilized to interpolate the tool tip points NURBS curve of EDNTP for five-axis machining. In terms of parameter synchronization model, interpolation algorithm can be mapped to NURBS curve of tool axis points. Simulation and experimental results show that the proposed algorithm can generate G(2) continuous EDNTP satisfying the given fitting accuracy and make the tool interpolate synchronously with the constant cutter length along the EDNTP during the interpolation process and achieve high machining precision which is mainly concentrated on the 10(-6) mm series.

关键词： Five-axis machining Dual quaternion Equidistant double NURBS Tool path interpolation algorithm

来源：评论

学校读者我要写书评

暂无评论

Lower complexity bounds for interpolation algorithms

引用

JOURNAL OF COMPLEXITY 2011年第2期27卷 151-187页

作者： Gimenez, Nardo Heintz, Joos Matera, Guillermo Solerno, Pablo Univ Buenos Aires Dept Computac RA-1428 Buenos Aires DF Argentina Consejo Nacl Invest Cient & Tecn RA-1428 Buenos Aires DF Argentina Univ Nacl Gen Sarmiento Inst Desarrollo Humano Buenos Aires DF Argentina Univ Cantabria Fac Ciencias Dept Math Estadist & Computac Santander 39071 Spain Univ Buenos Aires Dept Matemat RA-1428 Buenos Aires DF Argentina

We introduce and discuss a new computational model for the Hermite-Lagrange interpolation with nonlinear classes of polynomial interpolants. We distinguish between an interpolation problem and an algorithm that solves it. Our model includes also coalescence phenomena and captures a large variety of known Hermite-Lagrange interpolation problems and algorithms. Like in traditional Hermite-Lagrange interpolation, our model is based on the execution of arithmetic operations (including divisions) in the field where the data (nodes and values) are interpreted and arithmetic operations are counted at unit cost. This leads us to a new view of rational functions and maps defined on arbitrary constructible subsets of complex affine spaces. For this purpose we have to develop new tools in algebraic geometry which themselves are mainly based on Zariski's Main Theorem and the theory of places (or equivalently: valuations). We finish this paper by exhibiting two examples of Lagrange interpolation problems with nonlinear classes of interpolants, which do not admit efficient interpolation algorithms (one of these interpolation problems requires even an exponential quantity of arithmetic operations in terms of the number of the given nodes in order to represent some of the interpolants). In other words, classic Lagrange interpolation algorithms are asymptotically optimal for the solution of these selected interpolation problems and nothing is gained by allowing interpolation algorithms and classes of interpolants to be nonlinear. We show also that classic Lagrange interpolation algorithms are almost optimal for generic nodes and values. This generic data cannot be substantially compressed by using nonlinear techniques. We finish this paper highlighting the close connection of our complexity results in Hermite-Lagrange interpolation with a modern trend in software engineering: architecture tradeoff analysis methods (ATAM). (C) 2010 Elsevier Inc. All rights reserved.

关键词： Hermite-Lagrange interpolation interpolation problem interpolation algorithm Lower complexity bound Constructible map Geometrically robust map

来源：评论

学校读者我要写书评

暂无评论

Novel spatial and temporal interpolation algorithms based on extended field intensity model with applications for sparse AQI

引用

MULTIMEDIA TOOLS AND APPLICATIONS 2022年第14期81卷 19215-19236页

作者： Cai, Bo Shi, Zeyuan Zhao, Jianhui Wuhan Univ Sch Cyber Sci & Engn Wuhan 430072 Hubei Peoples R China Wuhan Univ Sch Comp Sci Wuhan 430072 Hubei Peoples R China

For the sparsely distributed air quality index (AQI), existing techniques have low efficiency to interpolate the value of a non-given point. Thus an extended field intensity model (EFIM) is proposed based on the Coulomb's law. Single parameter based EFIM is designed for spatial and temporal interpolations, and parameter c is used to control the attenuation of field intensity, while binary search method is adopted to calculate the optimal c. Next double parameters based EFIM is designed, and parameter k is added to control the range of influence, while iterative bilinear interpolation method is used to compute the optimal set of c and k. Then spatio-temporal interpolation is provided using spatial and temporal information simultaneously. The monitored AQIs from 4 cities of China are randomly collected as experiment data. Taking RMSE, AME, AEE as evaluation criterions and using 10-fold cross-validation, the new EFIM based algorithms perform better for spatial interpolation of sparse AQI than current methods, while double parameters based EFIM algorithms have higher precision than single parameter. Temporal related EFIM algorithms are also tested for their efficiency, and the normalized absolute error is defined to help indicate when spatio-temporal interpolation should be used. As a new approach for interpolation of sparse samples, our EFIM and algorithms have potential application in related fields.

关键词： Air quality index Coulomb’ s law Extended field intensity model interpolation algorithm

来源：评论

学校读者我要写书评

暂无评论

Image Sharpening algorithm Based on a Variety of interpolation Methods

Image Sharpening Algorithm Based on a Variety of Interpolati...

引用

4th International Conference on Image Analysis and Signal Processing (IASP)

作者： LiRui LvQiong QuJing Normal Univ Inst Tech Educ Qujing Peoples R China

ISBN: (纸本)9781467325455;9781467325479

Image sharpening is achieved by increasing the resolution of an original image. Specifically speaking, it can be achieved by calculating the new pixel information according to the information of surrounding pixels, which is called digital image interpolation. This thesis, because of the demand of image clarity, makes a more detailed analysis and research of the classic interpolation algorithm, and finds that piecewise polynomial interpolation in the traditional bicubic interpolation algorithm has a better approximation with the sync function. However, this piecewise polynomial interpolation only has the continuity of 0 to 1, which does no good for some details of the image. Thus, considering the reason hereinbefore, the writers conduct the deduction of the second order and obtain the relationship among the interpolated polynomial coefficients, then ultimately determining the interpolated polynomial coefficients and gets a superior bicubic interpolation polynomial through a large number of experimental validations.

关键词： digital image processing image sharpness interpolation algorithm convolution

来源：评论

学校读者我要写书评

暂无评论

A S-shape Curve Speed Control algorithm of Continuous Micro-lines interpolation Based on Adjustable Feed-Speed

A S-shape Curve Speed Control Algorithm of Continuous Micro-...

引用

International Conference on Manufacturing Engineering and Automation (ICMEA 2012)

作者： Shi, Zhong Quan Ding, Kun HOHAI Univ Sch Mech & Elect Engn Changzhou 213022 Peoples R China

ISBN: (纸本)9783037855300

To satisfy the need of high speed machining, according to machine's features and turning angle between micro-lines, constraining conditions of micro-lines turning feed speed are established in this paper. The algorithm is calculating the resolution of the end velocity of last line and the startup velocity of next line, and then deduce the acceleration on each axis. The resolution acceleration of each axis reflects the loading capacity of them and should not over a given value. Then a S-shape curve speed control algorithm of continuous micro-line interpolation based on adjustable real-time feed-speed is designed. When maximum feed velocity in a line changes from a low value to a high one suddenly, the velocity also tends to target smoothly by S-shape curve, and the velocity decreases to the end speed value in advance, and the total interpolation time decreases, machining efficiency rises evidently. At last, experiment which performed on the CNC system verifies the control algorithm. The result indicates that the algorithm can enhance the machining efficiency and improve surface quality based on assuring the machining precision.

关键词： Line turning Speed control High-speed machining interpolation algorithm

来源：评论

学校读者我要写书评

暂无评论

Sub-pixel Registration and Stitching Technology Based on interpolation and Iterative Optimization algorithm 39

Sub-pixel Registration and Stitching Technology Based on Int...

引用

39th Chinese Control Conference (CCC)

作者： Dong, Lin Xu, Xiangyang Shen, Yexiong Beijing Inst Technol Sch Automat Beijing 100081 Peoples R China

ISBN: (纸本)9789881563903

Image stitching is an important branch of image processing, and image stitching technology is widely used in academia and industry. As the previous step of stitching, the accuracy of image registration plays a key role in the process of stitching. Common algorithms such as SIFT and Harris are often used for feature extracting and feature matching, but the time complexity is high, at the same time, the extracted feature points are mostly pixel level, the accuracy of which is low. This paper proposes an improved Harris detection algorithm, by introducing bilinear interpolation algorithm, the feature points matching is located to the sub-pixel level;In the image stitching stage, iterative optimization is used to refine perspective transformation matrix. The experimental results show that the sub-pixel registration and stitching technology based on interpolation and iterative optimization greatly reduces the time complexity of feature extraction and effectively improves the accuracy of stitching.

关键词： Image registration Image stitching Sub-pixel interpolation algorithm Iterative optimization

来源：评论

学校读者我要写书评

暂无评论

Prediction-Correction algorithm of Cubic B-Spline Curve interpolation in Industrial Robot Control System Based on LinuxCNC

Prediction-Correction Algorithm of Cubic B-Spline Curve Inte...

引用

37th Chinese Control Conference (CCC)

作者： Shi Bu-Hai Lin Hai-Ming Ding Chuan South China Univ Technol Sch Automat Sci & Engn Guangzhou 510641 Guangdong Peoples R China South China Univ Technol Sch Design Guangzhou 510641 Guangdong Peoples R China

ISBN: (纸本)9789881563958

In order to make industrial robot control system based on LinuxCNC have the ability to process free curves, this paper studies the B-Spline curve's mathe-matics model and interpolation principle. Due to the large time complexity of Taylor series interpolation algorithm, a prediction-correction method of Cubic B-spline curve interpolation algorithm was proposed to calculate the parameter of next position. Since Motion controller is the core component of LinuxCNC, this paper studies the architecture of LinuxCNC's Motion controller and modify the source code of LinuxCNC to add the function of B-spline interpolation. The simulation results of MatLab proved that the prediction-correction B-spline interpolation algorithm take less time in calculating the parameter of next interpolation step. The simulation results in LinuxCNC show that the industrial robot can process complex free curves by B-spline interpolation after entering the corresponding control point.

关键词： prediction correction Cubic B-spline curve interpolation algorithm LinuxCNC

来源：评论

学校读者我要写书评

暂无评论

A COUNTER EXAMPLE FOR THE CONJECTURE IN AN algorithm FOR interpolation WITH UNITS IN H-INFINITY

引用

AUTOMATICA 1995年第1期31卷 165-165页

作者： PATEL, VV DATTA, KB INDIAN INST TECHNOL DEPT ELECT ENGNKHARAGPUR 721302W BENGALINDIA

It is conjectured by Dorato et al. [Automatica, 25, 427-430 (1989)], that the algorithm given by them for interpolation with units in H-infinity, gives the lowest possible degree unit. A counter example presented in t... 详细信息

关键词： interpolation algorithm UNITS IN H-INFINITY

来源：评论

学校读者我要写书评

暂无评论

Accuracy of compact-stencil interpolation algorithms for unstructured mesh finite volume solver

引用

HELIYON 2021年第4期7卷 e06875页

作者： Tasri, Adek Susilawati, Anita Univ Andalas Mech Engn Dept Padang 2135 Indonesia Univ Riau Mech Engn Dept Pekanbaru 28293 Indonesia

This study considers the accuracy of cell-to-face centre interpolation of convected quantities in unstructured finite volume meshes with cell-centred storage of variables. The accuracy of the interpolation algorithms were tested in isolation using ideal data to determine their numerical accuracy on both standard and artificially distorted meshes. It was found that the formally second- and third-order accurate interpolations based on one-dimensional interpolation along the line connecting the cells to the right and left of the face under consideration only have first-order accuracy in standard unstructured mesh, and less than first-order accuracy in distorted unstructured mesh. L1 interpolation errors in the distorted unstructured mesh are greater than in standard unstructured mesh. The order of accuracy and L1 errors can be improved by applying spatial corrections. The formally second-order accurate multi-dimensional interpolations tested in this study that are not based on one-dimensional interpolation along lines connecting the neighbour cells have first-order accuracy in both standard and distorted unstructured mesh. Linear interpolation between end vertices produces greatest L1 error in standard mesh;polynomial interpolation, linear interpolation between cell centres and standard QUICK produce the greatest L1 error in distorted mesh. Spatially correct QUICK, spatially correct linear interpolation between cell centres, Laplacian interpolation to face centres, and Taylor series expansion about an upstream cell produce the smallest L1 error in both standard and distorted mesh. Based on accuracy and the simplicity of implementation, Taylor series expansion about an upstream cell is the best choice for use in unstructured mesh.

关键词： Finite volume interpolation algorithm Unstructured mesh Accuracy comparison

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：