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

高等学校计算数学学报 2015年第3期37卷 234-243页

作者：郭巧檀结庆合肥工业大学数学学院

1引言一般的,我们在求解非线性方程的根时,利用最多的是迭代法,其迭代效果也各不一样[1-4].通常,我们在构造非线性方程求根的迭代方法有Newton迭代算法、Halley迭代算法和割线法等,而Newton迭代格式构造简单且收敛速度较快,又被认为是... 详细信息

1引言一般的,我们在求解非线性方程的根时,利用最多的是迭代法,其迭代效果也各不一样[1-4].通常,我们在构造非线性方程求根的迭代方法有Newton迭代算法、Halley迭代算法和割线法等,而Newton迭代格式构造简单且收敛速度较快,又被认为是求解一般非线性方程根的最常用方法.在:Newton迭代公式的推导过程中,利用最多的是泰勒展开式法、切线法、积分法[5].本文基于函数值Pad6逼近的行列式表示[6-7],构造出[1/0]、[1/1]、[1/2]阶Pade逼近

关键词： Pade approximation Taylor series expansion Convergence iterative algorithm

来源：评论

学校读者我要写书评

暂无评论

RESEARCH ON OFDM AND THE SINGLE CARRIER SIGNAL MODULATION RECOGNITION 5

RESEARCH ON OFDM AND THE SINGLE CARRIER SIGNAL MODULATION RE...

引用

Fifth International Conference on Instrumentation & Measurement, Computer, Communication, and Control (IMCCC)

作者： Gu Yebo Yang Minglei Harbin Inst Technol Harbin Peoples R China China Aerosp Sci & Technol Corp Shanghai Peoples R China

ISBN: (纸本)9781467377232

In recent years, the communication technology is developing rapidly and the way of the modulation of communication signals is sundry. Therefore, it is become very meaningful to do some research on OFDM and single carrier signal modulation recognition between class, as well as the single carrier signal modulation recognition within class. However, most traditional algorithms of these two types modulation recognitions are complex and have a big calculation. So it is very necessary to make improvements and reduce the computational complexity of the algorithms. This thesis does some analysis on the traditional method to reduce the computational complexity by extracting the new characteristic parameters.

关键词： modulation recognition OFDM spectrum analysis iterative algorithm multipath effects Doppler effect

来源：评论

学校读者我要写书评

暂无评论

Gradient-Based iterative Identification for Wiener Nonlinear Dynamic Systems with Moving Average Noises

引用

algorithmS 2015年第3期8卷 712-722页

作者： Zhou, Lincheng Li, Xiangli Xu, Huigang Zhu, Peiyi Changshu Inst Technol Sch Elect & Automat Engn Hushan Rd 99 Changshu 215500 Peoples R China

This paper focuses on the parameter identification problem for Wiener nonlinear dynamic systems with moving average noises. In order to improve the convergence rate, the gradient-based iterative algorithm is presented by replacing the unmeasurable variables with their corresponding iterative estimates, and to compute iteratively the noise estimates based on the obtained parameter estimates. The simulation results show that the proposed algorithm can effectively estimate the parameters of Wiener systems with moving average noises.

关键词： nonlinear dynamic system stochastic gradient iterative algorithm output error moving average parameter estimation

来源：评论

学校读者我要写书评

暂无评论

iterative algorithms with errors for zero points of m-accretive operators

引用

FIXED POINT THEORY AND APPLICATIONS 2013年第1期2013卷 1-17页

作者： Qin, Xiaolong Cho, Sun Young Wang, Lin Hangzhou Normal Univ Dept Math Hangzhou 310036 Zhejiang Peoples R China Gyeongsang Natl Univ Dept Math Jinju 660701 South Korea Yunnan Univ Finance & Econ Coll Stat & Math Kunming 650221 Peoples R China

In this paper, we study the convergence of paths for continuous pseudocontractions in a real Banach space. As an application, we consider the problem of finding zeros of m-accretive operators based on an iterative algorithm with errors. Strong convergence theorems for zeros of m-accretive operators are established in a real Banach space.

关键词： accretive operator fixed point nonexpansive mapping iterative algorithm zero point

来源：评论

学校读者我要写书评

暂无评论

STEP-ADAPTIVE APPROXIMATE LEAST SQUARES

STEP-ADAPTIVE APPROXIMATE LEAST SQUARES

引用

European Signal Processing Conference

作者： Michael Lunglmayr Christoph Unterrieder Mario Huemer Johannes Kepler University Linz Institute of Signal Processing Infineon Technologies AG

ISBN: (纸本)9781479988518

Recently, we proposed approximate least squares (ALS), a low complexity approach to solve the linear least squares problem. In this work we present the step-adaptive linear least squares (SALS) algorithm, an extension of the ALS approach that significantly reduces its approximation error. We theoretically motivate the extension of the algorithm, and introduce a low complexity implementation scheme. Our performance simulations exhibit that SALS features a practically negligible error compared to the exact LS solution that is achieved with only a marginal complexity increase compared to ALS. This performance gain is achieved with about the same low computational complexity as the original ALS approach.

关键词： Least squares Approximation iterative algorithm Complexity Approximate least squares

来源：评论

学校读者我要写书评

暂无评论

An adaptive switching scheme for iterative computing in the cloud

引用

Frontiers of Computer Science 2014年第6期8卷 872-884页

作者： Yu ZHANG Xiaofei LIAO Hai JIN Li LIN Feng LU Service Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China

Delta-based accumulative iterative computation （DAIC） model is currently proposed to support iterative algorithms in a synchronous or an asynchronous way. However, both the synchronous DAIC model and the asynchronous DAIC model only satisfy some given conditions, respectively, and perform poorly under other conditions either for high synchronization cost or for many redundant activations. As a result, the whole performance of both DAIC models suffers from the serious network jitter and load jitter caused by multi- tenancy in the cloud. In this paper, we develop a system, namely Hyblter, to guarantee the performance of iterative algorithms under different conditions. Through an adaptive execution model selection scheme, it can efficiently switch between synchronous and asynchronous DAIC model in order to be adapted to different conditions, always getting the best performance in the cloud. Experimental results show that our approach can improve the performance of current solutions up to 39.0%.

关键词： iterative algorithm computational skew communication skew cloud delta-based accumulative iterative computation

来源：评论

学校读者我要写书评

暂无评论

Measures of genuine multipartite entanglement for graph states

引用

Chinese Physics B 2014年第5期23卷 96-101页

作者：郭群群陈小余王赟赟 College of Information and Electronic Engineering Zhejiang Gongshang University

Graph states are special multipartite entangled states that have been proven useful in a variety of quantum information tasks. We address the issue of characterizing and quantifying the genuine multipartite entanglement of graph states up to eight qubits. The entanglement measures used are the geometric measure, the relative entropy of entanglement, and the logarithmic robustness, have been proved to be equal for the genuine entanglement of a graph state. We provide upper and lower bounds as well as an iterative algorithm to determine the genuine multipartite entanglement.

关键词： genuine entanglement graph state iterative algorithm

来源：评论

学校读者我要写书评

暂无评论

Positive Realness in Stochastic Subspace Identification: A Regularized and Reweighted Nuclear Norm Minimization Approach

Positive Realness in Stochastic Subspace Identification: A R...

引用

European Control Conference

作者： Huseyin Akcay Semiha Turkay Department of Electrical and Electronics Engineering Anadolu University

ISBN: (纸本)9781467371605

In this paper, we propose a method to transform a non-positive real transfer function matrix into a positive real one. This problem is of engineering interest and arises when a linear time-invarant dynamics is identified by stochastic subspace identification methods. Recent methods to tackle this problem are based on semi-definite programming schemes and as illustrated by numerical examples in this paper suffer from leakage effect at peak frequencies of the modified frequency response. The method proposed in this paper is inspired from the matrix rank minimization problem, which consists of finding a matrix of minimum rank satisfying given convex constraints. This NP-hard problem is then solved by an iteratively reweighted nuclear norm heuristic. We apply this heuristic to the problem considered in this paper. Numerical examples show that this method converges only in a few iterations and is effective in eliminating leakages at peak frequencies.

关键词： Positive realness Stochastic realization Sub-space identification Matrix rank minimization Nuclear norm iterative algorithm

来源：评论

学校读者我要写书评

暂无评论

Multiuser charging control in wireless power transfer via magnetic resonant coupling

Multiuser charging control in wireless power transfer via ma...

引用

IEEE International Conference on Acoustics, Speech and Signal Processing

作者： M. R. Vedady Moghadam R. Zhang ECE Dept. Nat. Univ. of Singapore Singapore Singapore

ISBN: (纸本)9781467369985

Magnetic resonant coupling (MRC) is a practically appealing method for realizing the near-field wireless power transfer (WPT). The MRC-WPT system with a single pair of transmitter and receiver has been extensively studied in the literature, while there is limited work on the general setup with multiple transmitters and/or receivers. In this paper, we consider a point-to-multipoint MRC-WPT system with one transmitter sending power wirelessly to a set of distributed receivers simultaneously. We derive the power delivered to the load of each receiver in closed-form expression, and reveal a "near-far" fairness issue in multiuser power transmission due to users' distance-dependent mutual inductances with the transmitter. We also show that by designing the receivers' load resistances, the near-far issue can be optimally solved. Specifically, we propose a centralized algorithm to jointly optimize the load resistances to minimize the power drawn from the energy source at the transmitter under given power requirements for the loads. We also devise a distributed algorithm for the receivers to adjust their load resistances iteratively, for ease of practical implementation.

关键词： Wireless power transfer iterative algorithm magnetic resonant coupling multiuser charging control optimization Receivers iterative algorithms Transmitters LOAD Energy sources Wireless power transfer Transmitter power requirement distributed algorithms Closed-form solutions CHARGING(ACCOUNTTNG) charging

来源：评论

学校读者我要写书评

暂无评论

Energy Efficient Power Allocation Scheme in Heterogeneous Cellular Networks

Energy Efficient Power Allocation Scheme in Heterogeneous Ce...

引用

International Conference on Wireless Communications and Signal Processing

作者： Yan Lin Shidang Li Yi Wang Chunguo Li Yongming Huang Luxi Yang Sch. of Inf. Sci. & Eng. Southeast Univ. Nanjing China

ISBN: (纸本)9781467376884

The deployment of small-cell access points (SCAs) is widely acknowledged as a promising network densification way to satisfy the future capacity needs of 5G wireless cellular network. In this paper, we study the power allocation problem in heterogeneous downlink network while satisfying QoS constraints and power constraints simultaneously. The scheme is formulated as maximizing the system energy efficiency and then transformed into a tractable convex optimization problem. Utilizing multiflow RZF beamforming to reduce complexity, an iterative algorithm is proposed with provable convergence. Numerical results compare the proposed algorithm in different simulation parameters and show that increasing the number of SCAs, the antennas per SCA and users could enhance the total system energy efficiency.

关键词： 5G mobile communication array signal processing cellular radio convex programming iterative methods quality of service telecommunication power management 5G wireless cellular network QoS SCA convex optimization problem energy efficient power allocation scheme heterogeneous cellular networks iterative algorithm multiflow RZF beamforming network densification small-cell access points Antennas Array signal processing Interference Optimization Quality of service Resource management Transmitters Quality of service array signal processing Cellular networks iterative algorithms cellular radio convex programming ANTENNA power splitting Transmitters iterative methods Energy efficiency management of resources Simulation parameter

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：