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

New iterative algorithms for Solving Coupled Markovian Jump Lyapunov Equations

IEEE TRANSACTIONS ON AUTOMATIC CONTROL 2015年第1期60卷 289-294页

作者： Wu, Ai-Guo Duan, Guang-Ren Harbin Inst Technol Shenzhen Grad Schoool Shenzhen 518055 Peoples R China Univ Western Australia Perth WA 6009 Australia Harbin Inst Technol Ctr Control Theory & Guidance Technol Harbin 150001 Peoples R China

In this technical note, two iterative algorithms are developed for solving the coupled Lyapunov matrix equations associated with discrete-time Markovian jump linear systems. Some convergence results have been obtained for these algorithms. The new algorithms are different from the previous results in nature and they can be regarded as sequential versions of the parallel algorithm reported in the work of Borno and Gajic. Numerical experiments show that the proposed algorithms are faster in terms of the number of iterations to achieve the desired accuracy.

关键词： Coupled Lyapunov equations iterative algorithms Markovian jump systems

来源：评论

学校读者我要写书评

暂无评论

Effect of garbage collection in iterative algorithms on Spark: an experimental analysis

引用

JOURNAL OF SUPERCOMPUTING 2020年第9期76卷 7204-7218页

作者： Kang, Minseo Lee, Jae-Gil Korea Adv Inst Sci & Technol Grad Sch Knowledge Serv Engn Daejeon South Korea

Spark is one of the most widely used systems for the distributed processing of big data. Its performance bottlenecks are mainly due to the network I/O, disk I/O, and garbage collection. Previous studies quantitatively analyzed the performance impact of these bottlenecks but did not focus on iterative algorithms. In an iterative algorithm, garbage collection has more performance impact than other workloads because the algorithm repeatedly loads and deletes data in the main memory through multiple iterations. Spark provides three caching mechanisms which are "disk cache," "memory cache," and "no cache" to keep the unchanged data across iterations. In this paper, we provide an in-depth experimental analysis of the effect of garbage collection on the overall performance depending on the caching mechanisms of Spark with various combinations of algorithms and datasets. The experimental results show that garbage collection accounts for 16-47% of the total elapsed time of running iterative algorithms on Spark and that the memory cache is no less advantageous in terms of garbage collection than the disk cache. We expect the results of this paper to serve as a guide for the tuning of garbage collection in the running of iterative algorithms on Spark.

关键词： Spark Garbage collection iterative algorithms Distributed processing Storage level

来源：评论

学校读者我要写书评

暂无评论

The Concept of iterative Functional algorithms in classical Sanskrit texts on Mathematics

The Concept of Iterative Functional Algorithms in classical ...

引用

AIML-Applications for Engineering & Technology (ICAET), International Conference on

作者： Namrata Karandikar Chandragupta Warnekar Cummins College of Engineering for Women Pune India

ISBN: (数字)9798350355611

ISBN: (纸本)9798350355628

The development of digital computers, coupled with the communication technology has created the modern Digital India, or in a wider sense, the Cyber world, speeding up the information exchange as well as commerce. As we all know, the Stored-program Electronic Digital Computer is an “Algorithmic” machine. It is the ‘Stored-program’ or the software part of this digital computer system that is based on the machine-oriented encoding of the corresponding set of suitably arranged algorithms. Often a systematic Developer follows the standard design cycle viz. Algorithm=> Flowchart => Coding=> App=> Testing, to create an optimal program (or an App) for a given task. Thus, a User in the cyber world indirectly invokes some ‘algorithm’ in the backend, while tapping various services via Apps! This paper depicts certain basic numerical algorithms and explores their original equivalents appearing through classical Sanskrit texts. After indicating the following Classical Sanskrit words, that connote the (modern acronym) word “Algorithm”, viz. The paper tabulates a few classical numerical Sanskrit-algorithms with their corresponding contemporary English languages equivalents. This research work has been undertaken as a follow up of the NEP-2020 of the Education Ministry of the Government of India, relating the scientific developments to classical Indian Knowledge System (IKS). Being written from a teaching point of view, the students, researchers, faculty members from any branch find this general/popular presentation interesting & useful. Considering the page and time limits, the discussions of large number of classical numerical Sanskrit algorithms (which essentially form the backend of modern cyber world) are presently bypassed here, and the paper is focused on certain algorithmic iterative Functions appearing through related classical Sanskrit texts.

关键词： Digital computers Computer science Systematics Terminology Software algorithms iterative algorithms Encoding Standards Testing Software development management

来源：评论

学校读者我要写书评

暂无评论

A penalty approach to iterative algorithms for envelope constrained filter design

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 1997年第7期45卷 1869-1873页

作者： Vo, B Cantoni, A Teo, KL CURTIN UNIV TECHNOL AUSTRALIAN TELECOMMUN RES INSTBENTLEYWA 6102AUSTRALIA

The discrete-time envelope-constrained (EC) filtering problem can be formulated as a quadratic programming (QP) problem with affine inequality constraints, This QP problem is approximated by an unconstrained minimization problem with two parameters, Descent direction-based algorithms are applied to solve the unconstrained problem iteratively. It is shown that these algorithms converge.

关键词： iterative algorithms Algorithm design and analysis Finite impulse response filter Costs Quadratic programming Signal processing algorithms Filtering Convergence Least squares approximation Signal design

来源：评论

学校读者我要写书评

暂无评论

iterative Recovery algorithms for Complex-Valued Distributed Compressed Sensing

Iterative Recovery Algorithms for Complex-Valued Distributed...

引用

International ITG Conference on Source and Channel Coding (SCC)

作者： Elena Sterk Robert F.H. Fischer Institute of Communications Engineering Ulm University Germany

ISBN: (数字)9798331522896

ISBN: (纸本)9798331522902

Distributed compressed sensing aims at the joint reconstruction of sparse signals with a common support. In some applications, complex-valued signals and sensing matrices are present. In this paper, we investigate recovery algorithms for complex-valued distributed scenarios. To that end, we review a compact exposition of complex- and vector-valued MMSE estimators. These can be used in approximate-message-passing-type algorithms. We explain joint reconstruction via iterative algorithms and evaluate suitable recovery algorithms. The performance of these algorithms is evaluated by numerical simulations for different scenarios.

关键词： Reviews Approximation algorithms Numerical simulation iterative algorithms Encoding Sensors Sparse matrices Compressed sensing

来源：评论

学校读者我要写书评

暂无评论

ADAPTIVE iterative algorithms FOR SPIKY DECONVOLUTION

引用

IEEE TRANSACTIONS ON ACOUSTICS SPEECH AND SIGNAL PROCESSING 1990年第8期38卷 1462-1466页

作者： FIGUEIRASVIDAL, AR DOCAMPOAMOEDO, D CASARCORREDERA, JR ARTESRODRIGUEZ, A UNIV SANTIAGO COMPOSTIAGO ESCULELA TECN SUPER INGN TELECOMUNDTCE-36280 VIGOSPAIN

Considering the joint detection-estimation character that spiky deconvolution problems have, an adaptively contracted (projection) selection operator is introduced to detect the nonzero values of the solution, which can be combined with iterative algorithms to offer very efficient schemes for solving these problems. A number of gradient-type algorithms based on this principle are described, and their performance is illustrated through simulation examples. The approach is based on the idea of reducing the noise and defining the signal in an iterative form. Another possibility is to define the signal and reduce the overall energy outside its domain, also in an iterative form. This algorithm is more expensive from a computational point of view; however, simulations indicate that it has somewhat different properties. It seems to be slightly less robust against the noise, while it offers better resolution and even more accurate amplitude estimates.< >

关键词： iterative algorithms Deconvolution Computational modeling Noise reduction iterative methods Noise robustness Noise level Energy resolution Signal resolution Amplitude estimation

来源：评论

学校读者我要写书评

暂无评论

ANN-Assisted iterative algorithms for Pattern Synthesis of Conformal Arrays

引用

IEEE ANTENNAS AND WIRELESS PROPAGATION LETTERS 2024年第10期23卷 3242-3246页

作者： Sun, Hai-Long Cheng, You-Feng Liao, Cheng Bai, Guo Zhao, Li Peng, Lin Southwest Jiaotong Univ Inst Electromagnet Chengdu 610031 Peoples R China Guilin Univ Elect Technol Key Lab Microwave & Opt Wave Applicat Technol Guilin 541004 Peoples R China

This letter proposes an efficient iterative method assisted by an artificial neural network (ANN) for pattern synthesis of arbitrary conformal arrays. Relying on a fast and accurate far-field evaluation solution based on the near-field Euler rotation and 2-D layer-wise fast Fourier transform (FFT) techniques, an ANN-ANN and an ANN-FFT iterative algorithms are constructed. The theoretical foundation, iterative process, and synthesis results are presented and analyzed. Numerical examples of synthesizing shaped, flat-top and 3-D low-sidelobe beams of different conformal arrays are provided to validate the synthesis performance of the algorithms in terms of efficiency and accuracy.

关键词： iterative algorithms Fast Fourier transforms Training Phased arrays Accuracy Artificial neural networks Transforms Artificial neural network (ANN) conformal array fast Fourier transform (FFT) pattern synthesis

来源：评论

学校读者我要写书评

暂无评论

ON THE TEXTURED iterative algorithms FOR A CLASS OF TRIDIAGONAL LINEAR-EQUATIONS

引用

IEEE TRANSACTIONS ON AUTOMATIC CONTROL 1994年第3期39卷 592-596页

作者： TANG, TS Department of Electrical Engineering and Computer Science Texas A and M University Kingsville Kingsville TX USA

The textured, iterative approximation algorithms are a class fast linear equation solvers [1], [2] and differ from the classical iterative algorithms fundamentally in their approximations of system matrices. The textured approach uses different approximations of a system matrix in a round-robin fashion while the classical approaches use a single fixed approximation. It therefore has a better approximation of system matrix and a potentially faster speed. In this note we prove that the convergent speed of the textured iterative algorithms for linear equations with a class of tridiagonal system matrices is strictly faster than the corresponding classical iterative algorithms. We also give the spectral radii of the textured iterative and classical algorithms for this class of linear equations. These results provide some insights and theoretical supports for the textured iterative algorithms.

关键词： iterative algorithms Equations Automatic control Optimal control Adaptive control Stochastic processes Servomechanisms Polynomials Writing Weight control

来源：评论

学校读者我要写书评

暂无评论

Mixed iterative algorithms for the multiple-set split equality common fixed-point problems without prior knowledge of operator norms

引用

OPTIMIZATION 2016年第5期65卷 1069-1083页

作者： Zhao, Jing Wang, Shengnan Civil Aviat Univ China Dept Math Tianjin Peoples R China

Let H-1, H-2, H-3 be real Hilbert spaces, let A : H-1 -> H-3, B : H-2 -> H-3 be two bounded linear operators. The multiple-set split equality common fixed-point problem (MSECFP) under consideration in this paper is to find x is an element of boolean AND(p)(i=1) F(U-i), y is an element of boolean AND(r)(j=1) F(T-j) such that Ax = By, (0.1) where p, r >= 1 are integers, U-i : H-1 -> H-1 (1 <= i <= p) and Tj : H-2 -> H-2 (1 <= j <= r) are quasi-nonexpansive mappings with nonempty fixed-point sets. Note that, the above problem (1) allows asymmetric and partial relations between the variables x and y. If B = I and H-2 = H-3, then the MSECFP (1) reduces to the multiple-set split common fixed-point problem proposed by Censor et al. In this paper, we introduce mixed cyclic and simultaneous iterative algorithms for the MSECFP (1). We introduce a way of selecting the stepsizes such that the implementation of our algorithms does not need any prior information about the operator norms. Weak convergence results are given.

关键词： the multiple-set split equality common fixed-point problem quasi-nonexpansive mapping weak convergence iterative algorithms Hilbert space

来源：评论

学校读者我要写书评

暂无评论

Strong convergence of iterative algorithms for the split equality problem

引用

JOURNAL OF INEQUALITIES AND APPLICATIONS 2014年第1期2014卷 1-19页

作者： Shi, Luo Yi Chen, Rudong Wu, Yujing Tianjin Polytechn Univ Dept Math Tianjin 300387 Peoples R China Tianjin Vocat Inst Tianjin 300410 Peoples R China

Let H-1, H-2,H-3 be real Hilbert spaces, C subset of H-1, Q subset of H-2 be two nonempty closed convex sets, and let A : H-1 -> H-3, B: H-2 -> H-3 be two bounded linear operators. The split equality problem (SEP) is finding x epsilon C, y epsilon Q such that Ax = By. Recently, Moudafi has presented the ACQA algorithm and the RACQA algorithm to solve SEP. However, the two algorithms are weakly convergent. It is therefore the aim of this paper to construct new algorithms for SEP so that strong convergence is guaranteed. Firstly, we define the concept of the minimal norm solution of SEP. Using Tychonov regularization, we introduce two methods to get such a minimal norm solution. And then, we introduce two algorithms which are viewed as modifications of Moudafi's ACQA, RACQA algorithms and KM-CO algorithm, respectively, and converge strongly to a solution of SEP. More importantly, the modifications of Moudafi's ACQA, RACQA algorithms converge strongly to the minimal norm solution of SEP. At last, we introduce some other algorithms which converge strongly to a solution of SEP.

关键词： split equality problem iterative algorithms converge strongly

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：