CodeBus
www.codebus.net
Search
Sign in
Sign up
Hot Search :
Source
embeded
web
remote control
p2p
game
More...
Location :
Home
Search - source code for compression
Main Category
SourceCode
Documents
Books
WEB Code
Develop Tools
Other resource
Search - source code for compression - List
[
Algorithm
]
FFT_Test
DL : 0
快速傅立叶变换的源代码,是个数字信号处理学习的好例子。-The source code of FFT,is a good example for digital singnal process study
Date
: 2025-12-26
Size
: 230kb
User
:
夏丏
[
Algorithm
]
200521511243234
DL : 0
用于数据流压缩的huffman算法源代码,VC程序-data flow for the Huffman compression algorithm source code, VC Program
Date
: 2025-12-26
Size
: 17kb
User
:
马克
[
Algorithm
]
SVD
DL : 0
% 奇异值分解 (sigular value decomposition,SVD) 是另一种正交矩阵分解法;SVD是最可靠的分解法, % 但是它比QR 分解法要花上近十倍的计算时间。[U,S,V]=svd(A),其中U和V代表二个相互正交矩阵, % 而S代表一对角矩阵。 和QR分解法相同者, 原矩阵A不必为正方矩阵。 % 使用SVD分解法的用途是解最小平方误差法和数据压缩。用svd分解法解线性方程组,在Quke2中就用这个来计算图形信息,性能相当的好。在计算线性方程组时,一些不能分解的矩阵或者严重病态矩阵的线性方程都能很好的得到解- Singular value decomposition (sigular value decomposition, SVD) is another orthogonal matrix decomposition method SVD decomposition is the most reliable method, but it takes more than QR decomposition near ten times the computing time. [U, S, V] = svd (A), in which U and V on behalf of two mutually orthogonal matrix, and the S on behalf of a diagonal matrix. And QR decomposition are the same, the original matrix A is no need for the square matrix. The use of SVD decomposition method are used as a solution of least squares error method and data compression. Using SVD decomposition solution of linear equations, in Quke2 on to use this information to calculate the graphics performance quite good. In the calculation of linear equations, some indecomposable matrix or serious pathological matrix of linear equations can be a very good solution
Date
: 2025-12-26
Size
: 3kb
User
:
zhxj
[
Algorithm
]
Algorithm_using_C
DL : 0
压缩包内有使用C语言编写的各种数学算法的源代码。-Compression packages have used a variety of C language source code for mathematical algorithms.
Date
: 2025-12-26
Size
: 325kb
User
:
PJian
CodeBus
is one of the largest source code repositories on the Internet!
Contact us :
1999-2046
CodeBus
All Rights Reserved.