attachments

lsqr.m 基于QR正交分解的最小二乘法......(lsqr.m QRLS............................)

WENO SCHEME HYBRIDIZED WITH COMPACT SCHEME FOR EULER EQUATIONS

Basic matlab codes tutorial

说明：  Matlab从入门到精通中所有的源程序。(Matlab from entry to master all of the source.)

基于MRAS无速度传感器的永磁同步电机的仿真模型，可以实现较好的仿真结果。(MRAS based speed sensorless permanent magnet synchronous motor simulation model, can achieve a better simulation results.)

this code performs the building matrix and coding message and outputs the coded message

一个关于MATLAB与c混合编程的资料，适合与混合编程的初学者(1 c mixed on MATLAB programming and data, suitable for beginners and mixed programming)

说明：  基于MATLAB 2PSK的解调与调制 的毕业设计的源代码(MATLAB-based modulation and demodulation 2psk graduation design source)

粒子群算法 粒子群算法 粒子群算法 粒子群算法(Partical Swarm Optimization PSO matlab Partical Swarm Optimization Partical Swarm Optimization Partical Swarm Optimization Partical Swarm Optimization Partical Swarm OptimizationPartical Swarm Optimization)

) Compression using huffman code -with a number of bits k per code word -provide huffman table Huffman coding is optimal for a symbol-by-symbol coding with a known input probability distribution.This technique uses a variable-length code table for encoding a source symbol. The table is derived in a particular way based on the estimated probability of occurrence for each possible value of the source symbol .Huffman coding uses a specific method for representing each symbol, resulting in a prefix code that expresses the most common characters using shorter strings of bits than those used for less common source symbols.The Huffman coding is a procedure to generate a binary code tree. () Compression using huffman code -with a number of bits k per code word -provide huffman table Huffman coding is optimal for a symbol-by-symbol coding with a known input probability distribution.This technique uses a variable-length code table for encoding a source symbol. The table is derived in a particular way based on the estimated probability of occurrence for each possible value of the source symbol .Huffman coding uses a specific method for representing each symbol, resulting in a prefix code that expresses the most common characters using shorter strings of bits than those used for less common source symbols.The Huffman coding is a procedure to generate a binary code tree. )