Search - givens

Search - givens - List

[Other] prime-tree DL : 0: 最小生成树：利用普鲁姆算法，完成将给定节点和边的权值的图生成最小生成树，用于各项公共事业最少经费的设计方法-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
Update : 2008-10-13 Size : 1.62kb Publisher : 杨翠
[Other resource] givens DL : 0: Givens transformation是向量的旋转变换。它可将被变换向量旋转成模与之相同的其它向量。其应用之一是QR分解。
Update : 2008-10-13 Size : 812byte Publisher : yzd
[Other resource] qr_givens DL : 0: 基于Givens transformation的QR分解。其使用需要调用Givens transformation程序。
Update : 2008-10-13 Size : 943byte Publisher : yzd
[Mathimatics-Numerical algorithms] 离散牛顿法 DL : 2: 解非线性方程组的一种方法：先用一种优化方法将给定初值（它有可能会使得后续的牛顿法发散）通过一条比较快的途径收敛到精确解附近，得到一个新的初始点，然后再通过牛顿法将新的初始点迭代到精确解（一定的误差范围内）。这种方法的优点在于：它可以将牛顿法快速收敛的优势发挥出来，同时又避免了该方法收敛域比较窄的缺点。-solving nonlinear equations in a way : by using a method of optimizing initial Givens (it might make follow-up to Newton's law divergence) adopted a relatively fast convergence to the channel near the exact solution, to be a new starting point, and then Newton's law of the new iteration of the initial point of the exact solution ( some of error). This method has the advantage : it can be rapid convergence of Newton's method to exploit the advantages while avoiding convergence of the method is relatively narrow domain shortcomings.
Update : 2008-10-13 Size : 32.61kb Publisher : 王廷
[Mathimatics-Numerical algorithms] 离散牛顿法 DL : 0: 解非线性方程组的一种方法：先用一种优化方法将给定初值（它有可能会使得后续的牛顿法发散）通过一条比较快的途径收敛到精确解附近，得到一个新的初始点，然后再通过牛顿法将新的初始点迭代到精确解（一定的误差范围内）。这种方法的优点在于：它可以将牛顿法快速收敛的优势发挥出来，同时又避免了该方法收敛域比较窄的缺点。-solving nonlinear equations in a way : by using a method of optimizing initial Givens (it might make follow-up to Newton's law divergence) adopted a relatively fast convergence to the channel near the exact solution, to be a new starting point, and then Newton's law of the new iteration of the initial point of the exact solution ( some of error). This method has the advantage : it can be rapid convergence of Newton's method to exploit the advantages while avoiding convergence of the method is relatively narrow domain shortcomings.
Update : 2025-03-07 Size : 32kb Publisher : 王廷
[Other] prime-tree DL : 0: 最小生成树：利用普鲁姆算法，完成将给定节点和边的权值的图生成最小生成树，用于各项公共事业最少经费的设计方法-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
Update : 2025-03-07 Size : 1kb Publisher : 杨翠
[Algorithm] givens DL : 0: 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.
Update : 2025-03-07 Size : 1kb Publisher : yzd
[Algorithm] qr_givens DL : 0: 基于Givens transformation的QR分解。其使用需要调用Givens transformation程序。-Givens transformation based on the QR decomposition. Their use need to call Givens transformation process.
Update : 2025-03-07 Size : 1kb Publisher : yzd
[Other] Givens DL : 0: 矩阵论中比较重要的一种算法givens矩阵变换算法自己编写的调试通过-矩阵论more important givens of an algorithm matrix transformation algorithm I have written through the debug
Update : 2025-03-07 Size : 39kb Publisher : caomin
[matlab] UCA_SMI DL : 0: 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.
Update : 2025-03-07 Size : 1kb Publisher : 张亚光
[Algorithm] QR DL : 0: 矩阵全部特征值的QR方法，包括化一般矩阵为上Hessenberg阵，平面旋转阵(Givens变换阵)，用 Givens变换对上Hessenberg阵作QR分解，原点平移加速的QR方法等-Eigenvalue matrix of all the QR methods, including the general of the Hessenberg matrix array, planar array rotation (Givens transformation matrix), with the Givens transform Hessenberg array for QR decomposition, the starting point to accelerate the translation of the QR method
Update : 2025-03-07 Size : 249kb Publisher : 王强
[matlab] QRGivens DL : 0: QR decomposition via Givens rotations.
Update : 2025-03-07 Size : 1kb Publisher : iskandaria
[Software Engineering] RF_power_amplifier_in_Digital_pre-distortion_techn DL : 0: 射频功放数字预失真技术研究及其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
Update : 2025-03-07 Size : 4.81mb Publisher : 蔡蔡
[matlab] part_XI DL : 0: Givens Rotation implementation of adaptive filters.
Update : 2025-03-07 Size : 1.51mb Publisher : Punter
[Other] givens DL : 0: givens 旋转，快速求解矩阵特征值的一种算法-givens rotation
Update : 2025-03-07 Size : 1kb Publisher : zhufangjun
[matlab] givens DL : 0: GIVENS ALGORITHM MATLAB
Update : 2025-03-07 Size : 1kb Publisher : xellosmath
[Algorithm] Givens-method DL : 0: 用Givens方法求解矩阵本征值，通过迭代得到矩阵本征值，精度很高-Use Givens method to compute Eigenvalue and Eigenvector of Matrix
Update : 2025-03-07 Size : 2kb Publisher :
[matlab] household-givens DL : 1: 运用matlab编程语言，实现利用Householder变换和Givens变换求解矩阵的QR分解-Use matlab programming language, the realization and the Givens transformations using the Householder transformation matrix QR decomposition to solve
Update : 2025-03-07 Size : 153kb Publisher : 陈佃文
[source in ebook] Givens代码及说明 DL : 0: 数值线性代数中的givens变换，matlab语言实现(Givens transformation in numerical linear algebra and implementation of MATLAB language)
Update : 2025-03-07 Size : 9kb Publisher : 端木wx
[matlab] 新建文件夹 DL : 0: 用matlab实现Givens变换，具体说明见m文件(Givens transform matlab code)
Update : 2025-03-07 Size : 1kb Publisher : luffy20171201

« 12 3 »