首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献，搜索用时 31 毫秒
1.
In this paper we consider the problem of permuting a large sparse n×n matrix into an optimum bordered triangular form using nonsymmetric permutations. By making use of the degree switching operations in the digraph of the matrix and minimum essential set of the digraph we present a formal solution to the problem. Next we present an algorithm for finding a minimal essential set for a strongly connected digraph using the structural properties of the digraph. We also present an algorithm for permuting a n×n matrix into a near optimum bordered triangular form by making use of output set assignment concepts. Examples are given to illustrate our algorithms.  相似文献   

2.
In this paper, a distributed projection algorithm based on the subgradient method is presented to solve the distributed optimization problem with a constrained set over a directed multi-agent network, where the designed protocol is scaled by the left eigenvector associated with the weighted adjacency matrix. By using the property of the projection operation and nonnegative almost supermartingales, we give the convergence analysis of our algorithm and show that the optimal solution is the ultimate consensus state of all agents to be reached. A numerical simulation for a specific optimization problem is given to verify the effectiveness of our algorithm.  相似文献   

3.
Standard forms are presented which define transfer functions for optimum type 1 and type 2 feedback control systems, where systems with minimum integral of time multiplied absolute value of error in the presence of a step displacement input are considered to be optimum. The ITAE criterion adopted in this paper was previously introduced by Graham and Lathrop.The optimization procedure leading to the standard forms presented here, is based upon an all digital simulation coupled to an unconstrained optimization algorithm to minimize the ITAE criterion value.It is shown with the aid of examples how actual systems can be compensated by use of appropriate standard forms to obtain optimum responses.  相似文献   

4.
This paper develops a distributed reconstruction algorithm, that can be implemented efficiently, for time-varying graph signals. The reconstruction problem is formulated as an unconstrained optimization problem that minimizes the weighted sum of the data fidelity term and the regularization term. The regularizer used is the nonsmoothness measure of the temporal difference signal. The classical Newton’s method can be used to solve the optimization problem. However, computation of the Hessian matrix inverse is required, and this does not scale well with the graph size. Furthermore, a distributed implementation is not possible. An approximation to the inverse Hessian, that exploits the graph topology, is developed here. The resulting iterative algorithm can be implemented in a distributed manner, and scales well with the graph size. Convergence analysis of the algorithm is presented, which shows convergence to the global optimum. Numerical results, using both synthetic and real world datasets, will demonstrate the superiority of the proposed reconstruction algorithm over existing methods.  相似文献   

5.
This paper investigates the bipartite leader-following consensus of second-order multi-agent systems with signed digraph topology. To significantly reduce the communication burden, an event-triggered control algorithm is proposed to solve the bipartite leader-following consensus problem, where a novel event-triggered function is designed. Under some mild assumptions on the network topology and node dynamics, a sufficient condition is derived using Lyapunov stability method and matrix theory to guarantee the bipartite consensus. In particular, it is shown that the continuous communication can be avoided and the Zeno-behavior can be excluded for the designed event-triggered algorithm. Numerical simulations are presented to illustrate the correctness of the theoretical analysis.  相似文献   

6.
This paper proposes a privacy-preserving consensus algorithm which enables all the agents in the directed network to eventually reach the weighted average of initial states, and while preserving the privacy of the initial state of each agent. A novel privacy-preserving scheme is proposed in our consensus algorithm where initial states are hidden in random values. We also develop detailed analysis based on our algorithm, including its convergence property and the topology condition of privacy leakages for each agent. It can be observed that final consensus point is independent of their initial values that can be arbitrary random values. Besides, when an eavesdropper exists and can intercept the data transmitted on the edges, we introduce an index to measure the privacy leakage degree of agents, and then analyze the degree of privacy leakage for each agent. Similarly, the degree for network privacy leakage is derived. Subsequently, we establish an optimization problem to find the optimal attacking strategy, and present a heuristic optimization algorithm based on the Sequential Least Squares Programming (SLSQP) to solve the proposed optimization problem. Finally, numerical experiments are designed to demonstrate the effectiveness of our algorithm.  相似文献   

7.
By means of the real linear operator, we establish an iterative algorithm for solving a class of complex generalized coupled Sylvester matrix equations. The finite termination of the proposed algorithm is proved. By representing a complex matrix as a larger real matrix, we present a new method to prove that the minimum-norm solution or minimum-norm least squares solution of the complex generalized coupled Sylvester matrix equations can be obtained by an appropriate selection for the initial matrices, which has not been found in the existing work. Numerical experiments on some randomly generated data and practical image restoration problem show that the proposed algorithm is feasible and effective.  相似文献   

8.
Many science and engineering problems can be represented by a network, a generalization of which is a graph. Examples of the problems that can be represented by a graph include: cyclic sequential circuit, organic molecule structures, mechanical structures, etc. The most fundamental issue with these problems (e.g., designing a molecule structure) is the identification of structure, which further reduces to be the identification of graph. The problem of the identification of graph is called graph isomorphism. The graph isomorphism problem is an NP problem according to the computational complexity theory. Numerous methods and algorithms have been proposed to solve this problem. Elsewhere we presented an approach called the eigensystem approach. This approach is based on a combination of eigenvalue and eigenvector which are further associated with the adjacency matrix. The eigensystem approach has been shown to be very effective but requires that a graph must contain at least one distinct eigenvalue. The adjacency matrix is not shown sufficiently to meet this requirement. In this paper, we propose a new matrix called adjusted adjacency matrix that meets this requirement. We show that the eigensystem approach based on the adjusted adjacency matrix is not only effective but also more efficient than that based on the adjacency matrix.  相似文献   

9.
This paper concerns data transmissions for large-scale T–S fuzzy systems with event-triggering control, where each subsystem communicates its information via a two-channel network. We propose an event-triggering scheme in which two event-triggering mechanisms are used to verify the data transmissions. At first, a novel model transformation is presented, where the event-triggered control system is reconstructed as a constant-delay system with extra inputs and outputs. By using a relaxed Lyapunov–Krasovskii functional (LKF) without the requirement of positive definiteness for all Lyapunov matrices, and the scaled small gain (SSG) theorem, the co-design problem of desired observer and controller gains, event-triggering parameters, and the sampling period is resolved in the form of linear matrix inequalities (LMIs). It will be shown that the solution guarantees the stability of closed-loop fuzzy control system and the reductions of data communications in both the sensor-to-controller and controller-to-actuator channels. The proposed method is validated by using a numerical example.  相似文献   

10.
卢诚波 《科技通报》2007,23(1):6-10
指出了文《R-循环分块矩阵求逆的快速傅里叶算法》中的一个错误，并证明了n阶r-循环矩阵的m次方根矩阵中仍为r-循环矩阵的矩阵个数为m^n，进一步给出了求n阶r-循环矩阵的m次方根矩阵中仍为r-循环矩阵的矩阵的快速算法，若用FFT计算一个m次方根矩阵，其时间复杂性为O（nlog2n）；计算全部平方根矩阵的时间复杂性为O（nm^n）。同时，本文还给出了求r-循环矩阵主平方根矩阵的算法。  相似文献   

11.
The definite integral is generally interpreted geometrically as an “area”. An alternate interpretation as a steady-state “flux” through a unit slab is derived, which leads to a new method of numerical integration. The usual sum of a large number of approximate areas is replaced by the flux through a “single” increment.The method involves the solution of a system of linear finite difference equations. The coefficient matrix is tri-diagonal and is solved efficiently by the Thomas algorithm. During the iterative process the coefficients are determined by simple quadrature schemes applied to each increment.Error analysis revealed that an expression could be derived for the roundoff error associated with the final Thomas iteration. It is shown that the roundoff error is smallest when the matrix coefficients ak\S>1. The method is shown to be superior to the classical methods due to its simplicity and tolerance for variable increment size. In addition, a new function is determined which is useful in diffusion studies. Numerical data are presented confirming these results.  相似文献   

12.
李铁钢  马驷良  王春胜 《现代情报》2006,26(12):207-208,223
控制用户的重入网是移动运营商目前十分头疼的问题，由于重入网带来的卡号资源浪费、欠费等后果造成了运营商营销成本增加和业务收入下滑，因此控制用户的重入网是当前移动运营商十分关注的热点问题，而困扰这一问题的瓶颈在于现有重入网识别技术不够成熟．准确率低、识别时间过长，不能起到有效的控制作用。在本文中，笔者结合生产实际，对“呼叫指纹”算法进行了改进，提出了新的特征提取方法和匹配算法，提高了识别的准确率和识别速度。同时对外网用户建立了指纹档案，满足了实际生产中对转网、离网率分析和市场占有率估算的要求。Markov模型在经济市场分析和预测中的应用已经十分广泛，但大多应用是在已知转移概率矩阵的情况，对于转移概率未知的情况相关的论述很少。本文指出了文献[1]提出的计算转移概率矩阵的错误之处，并根据“呼叫指纹”识别算法给出了转移概率矩阵．并根据它进行了市场占有率的测算．在实际中取得了很好的效果。  相似文献   

13.
In real-life applications, resources in construction projects are always limited. It is of great practical importance to shorten the project duration by using intelligent models (i.e., evolutionary computations such as genetic algorithm (GA) and particle swarm optimization (PSO) to make the construction process reasonable considering the limited resources. However, in the general EC-based model, for example, PSO easily falls into a local optimum when solving the problem of limited resources and the shortest period in scheduling a large network. This paper proposes two PSO-based models, which are resource-constrained adaptive particle swarm optimization (RC-APSO) and an input-adaptive particle swarm optimization (iRC-APSO) to respectively solve the static and dynamic situations of resource-constraint problems. The RC-APSO uses adaptive heuristic particle swarm optimization (AHPSO) to solve the limited resource and shortest duration problem based on the analysis of the constraints of process resources, time limits, and logic. The iRC-APSO method is a combination of AHPSO and network scheduling and is used to solve the proposed dynamic resource minimum duration problem model. From the experimental results, the probability of obtaining the shortest duration of the RC-APSO is higher than that of the genetic PSO and GA models, and the accuracy and stability of the algorithm are significantly improved compared with the other two algorithms, providing a new method for solving the resource-constrained shortest duration problem. In addition, the computational results show that iRC-APSO can obtain the shortest time constraint and the design scheme after each delay, which is more valuable than the static problem for practical project planning.  相似文献   

14.
一种前馈神经网络算法   总被引：2，自引：0，他引：2  
神经网络由于其非线性处理能力强，性能稳定等特点得到了广泛应用和研究，主要应用于模式识别、信号处理、知识工程、专家系统、优化组合、机器人控制等。神经网络中使用最为广泛的就是前馈神经网络，其网络权值学习算法中影响最大的就是误差反向传播算法(back-propagation简称BP算法)。BP算法存在局部极小点，收敛速度慢等缺点，基于优化理论的Levenberg-Marquardt算法忽略了二阶项，该文讨论当误差不为零或者不为线性函数即二阶项S(W)不能忽略时的Hesse矩阵的近似计算，进而训练网络。  相似文献   

15.
《Journal of The Franklin Institute》2022,359(18):11135-11154
A class of resource allocation problems with equality constraint are considered in this paper, such as economic dispatch problem in smart grid systems, which is essentially an optimization problem. Inspired by the Lagrange multiplier method, the resource allocation problem is transformed into a multi-agent consensus problem for large-scale networked distributed nodes. A consensus-based distributed fixed-time optimization algorithm is presented, where the information exchange network is depicted by a strongly connected and weight-balanced digraph. This type of communication network can ensure that the equality constraint always holds. Moreover, a new globally fixed-time stability theorem for nonlinear systems is first given in this paper. Based on this theorem and consensus theory, the optimal resource allocation scheme can be given in a fixed time. Finally, the application and comparison of the designed algorithm show that the algorithm can effectively solve the allocation problem of power resources such as economic dispatch.  相似文献   

16.
Cellular neural network (CNN) is a type of analog, nonlinear, real-time parallel processing network. The paper studies an implementation of the integrated operational amplifier used in the design of an artificial CNN. It improves the implementation of CNN proposed by Chua. A 4 x 4 artificial CNN circuit is designed, obtaining a better characteristic of a CNN connected component detector. Finally, a fast algorithm for a CNN component detector is given which proves to be very simple and quite convenient.  相似文献   

17.
A linearly variable element is any passive two-terminal network element in which the immittance varies linearly with respect to an independent (of frequency) real variable, x. A definite set of fundamental passive two terminal network elements (F- elements) consisting of fixed passive elements and linearly variable elements is presented. It is shown that any network consisting of only F-elements has a driving point immittance, D(s,x), that is positive real for s complex, x real and positive real for x complex, s real. Conditions on the variable coefficients, degree and location of zeros and poles of D(s,x) are established. A method of testing whether D(s,x) is positive real for one complex and one real variable is developed. This testing is accomplished by extending the Hurwitz and Sturm test to one complex and one real variable.  相似文献   

18.
In this paper we present an O(¦V·log¦V) algorithm for finding an optimum path between two nodes in an edge-sparse network using a new approach. The method exploits the data structure and a simple breadth-first search process.  相似文献   

19.
A new algorithm for the synthesis of cut-set matrices is given. The main idea of the algorithm is to transform the given matrix into an incidence matrix, if exists. The effeciency of the method is shown by a comparison of execution times for the computer program of this method and other methods.  相似文献   

20.
朱华桂  乔联宝 《科研管理》2012,33(11):89-95
首先提出了连续时间的网络截流选址问题,并以保护整个道路交通网络为目标,建立了防御性醉酒驾驶拦截问题的模型。根据问题的特征,分别设计了基于时间的迭代改进算法和离散选址问题的拉格朗日启发式算法,并通过随机实例对算法进行了测试。结果表明:连续时间的同步拦截问题可以通过分离连续的时间变量和离散的选址变量的方法,多次求解覆盖问题而有效解决,并且迭代改进算法对时间的搜索性更强,从而能够用较少的迭代次数解决原问题。  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号