Welcome![Sign In][Sign Up]
Location:
Search - givens algorithm

Search list

[Otherprime-tree

Description: 最小生成树:利用普鲁姆算法,完成将给定节点和边的权值的图生成最小生成树,用于各项公共事业最少经费的设计方法-minimum spanning tree : pass algorithm, Givens completed nodes and the right side of the value of the minimum spanning tree generation for public utilities at least for the design method
Platform: | Size: 1656 | Author: 杨翠 | Hits:

[Otherprime-tree

Description: 最小生成树:利用普鲁姆算法,完成将给定节点和边的权值的图生成最小生成树,用于各项公共事业最少经费的设计方法-minimum spanning tree : pass algorithm, Givens completed nodes and the right side of the value of the minimum spanning tree generation for public utilities at least for the design method
Platform: | Size: 1024 | Author: 杨翠 | Hits:

[Algorithmgivens

Description: Givens transformation是向量的旋转变换。它可将被变换向量旋转成模与之相同的其它向量。其应用之一是QR分解。-Givens transformation is the vector of the rotation transformation. It can transform vector will be rotating into the same mold with the other vector. One of its applications QR decomposition.
Platform: | Size: 1024 | Author: yzd | Hits:

[OtherGivens

Description: 矩阵论中比较重要的一种算法givens矩阵变换算法 自己编写的 调试通过-矩阵论more important givens of an algorithm matrix transformation algorithm I have written through the debug
Platform: | Size: 39936 | Author: caomin | Hits:

[matlabUCA_SMI

Description: QR分解SMI算法的目的正是要避免直接来解线性方程,而是将自相关矩阵分解,并利用Givens旋转实现数据矩阵的QR分解,最终将权矢量的求解问题转化为三角线性方程组的求解问题。-QR decomposition SMI algorithm, whose objective it is to avoid directly to solution of linear equations, but will auto-correlation matrix decomposition, and the use of Givens rotation implementation of the QR decomposition of data matrix, the weight vector will eventually solve the problem into a triangular system of linear equations solving the problem.
Platform: | Size: 1024 | Author: 张亚光 | Hits:

[Algorithmqrtrannnn

Description: 功能:对矩阵A的左上角的m阶对角块作QR变换:先用Givens变换作QR分解A=QR, 再作相似变换A:=Q AQ=RQ. 输入: n阶HessenbergA,其中A(m+1,m)=0,m>2. 输出: 变换后的Hessenberg形矩阵A. 2 用基本QR算法求实方阵的全部特征值.-Function: the upper left corner of the matrix A, diagonal blocks of order m to QR transformation: first, to make QR decomposition using Givens transformations A = QR, re-similarity transformation A: = Q' AQ = RQ. Input: n-order HessenbergA, where A (m+1, m) = 0, m> 2. Output: transformed Hessenberg form matrix A. 2 matrix with the basic QR algorithm for all the characteristics of the value of truth-seeking.
Platform: | Size: 1024 | Author: huanhuan | Hits:

[Software EngineeringRF_power_amplifier_in_Digital_pre-distortion_techn

Description: 射频功放数字预失真技术研究及其FPGA实现,文中介绍了数字预失真的实现架构,介绍了QRD_RLS算法实现的相关CORDIC技术,GIVENS旋转,以及systolic阵等原理-RF power amplifier digital pre-distortion technology and its FPGA implementation, this paper describes the realization of digital pre-distortion framework introduced QRD_RLS relevant CORDIC algorithm implementation techniques, GIVENS rotation, and other systolic array principles
Platform: | Size: 5043200 | Author: 蔡蔡 | Hits:

[VHDL-FPGA-Verilogcomplex_givens

Description: 基于cordic算法的givens变换实现矩阵QR分解-Transform matrix QR decomposition based on the givens of cordic algorithm
Platform: | Size: 1024 | Author: fred | Hits:

[matlabgivens

Description: GIVENS ALGORITHM MATLAB
Platform: | Size: 1024 | Author: xellosmath | Hits:

CodeBus www.codebus.net