搜索资源列表
Compelx-ELM
- 复数极限学习机，Fully Complex Extreme Learning Machine-Fully Complex Extreme Learning Machine
fushujisuanqi
- 在vc6.0下写的mfc复数计算器，仅供参考-mfc fushu calculator
Complex
- 复数类的C++程序设计，complex.cpp仅仅实现+和*功能-complex.cpp file
String
- myString.cpp关于一个复数类的设计，实现了+和*的功能-very good string
DoubleDensityWavelet
- 二维双密度双树（复数）小波变换包。包含基于小波变换的基本的阈值处理运算。-2-D Double-Density Complex Wavelet Transform。There are two versions of the 2-D double-density dual-tree DWT: (1) The 2-D double-density dual-tree real-oriented DWT, which is 2-times expansive, and (2) The 2-D doub
cldtcwt
- 基于OpenCL实现的双树复数小波变换。包含基于特征点的的极坐标匹配算法。-OpenCL implementation of the Dual Tree Complex Wavelet Transform. This package contains code to perform the dual-tree complex wavelet transform in an accelerated manner user OpenCL. It also includes an implement
dm
- 有限差分法分列矩阵，适用于复数点阵的有限差分运算-finite diffential matrix
LU
- LU分解法求解线性方程组Ax=b.该程序为直接求解法，可以实现对实数和复数的计算。程序较简练，但是运行的效率较高。-Crout s decomposition method for solving of n linear equations:Ax=b
cx1
- 用Java语言实现求解一元二次方程的根，包括实数根和复数根的情况，其中实数根又分为重根和非重根的情况。-Implemented in the Java language a yuan quadratic equation root, including real root and plural situation, the real root and divided into heavy root and the root.
calculator
- 该计算器不仅实现了标准的运算还是实现了科学运算和复数的运算，是一个多功能的计算器。-The calculator is not only realize the standard operation or implementation of the scientific computing and plural computing, is a multi-function calculator
Test_VCU_CFFT128
- DSP F2833x 128个点的复数快速傅里叶变换-DSP F2833x 128-point complex Fast Fourier Transform
ComplexNumberTest
- 演示复数的运算，包括加键乘运算，定义了一个复数类和测试该类的主类-Demonstrate complex operations, including addition multiplication key, defines the main class of a complex class and test class
Newton-Raphson
- 一种在实数域和复数域上近似求解方程的方法。多数方程不存在求根公式。-An approximate method for solving equations in real and complex domains. Most equations do not exist formula.
FFTVPP
- 快速福利叶变换C函数 函数简介：此函数是通用的快速傅里叶变换C语言函数，移植性强，以下部分不依 赖硬件。此函数采用联合体的形式表示一个复数，输入为自然顺序的复 数（输入实数是可令复数虚部为0），输出为经过FFT变换的自然顺序的 复数 使用说明：使用此函数只需更改宏定义FFT_N的值即可实现点数的改变，FFT_N的 应该为2的N次方，不满足此条件时应在后面补0 -kuaisu fuliye bianhuan yuandaima ,VC++shixian ,yu
fushu
- 可以用复数的曲线图，用了画饼控件，可以做成模块-You can use the plural graph yourselves with the control module can be made
MyFFT
- 基于C语言的任意n点FFT算法实现。可自动实现16位以内的位倒序。输入实数数列，输出复数数列。-The realization of arbitrary point n C language based on FFT algorithm. Bit reverse more than 16 can automatically realize. In real sequence, the output of complex numbers.
complex
- 实现一个复数类,包含复数的定义以及加减等运算。并包换有test的程序代码。-Realization of a complex class that contains definitions and complex addition and subtraction operations. And replacement have test program code.
CeShi2
- 已知复数矩阵A求A的逆矩阵B，这个过程比较复杂。- finding the inverse matrix
complex_add_multiply
- 设两个复数A=a+bi, B=c+di(其中a,c为实部,c,d为虚部) 则A+B=a+c+(b+d)i A*B=ac-bd+(ad+bc)i，用单链表实现-complex add and multiply
fushu
- 定义复数类，通过成员函数重载运算符-（求负）、-=、!=，通过友元函数重载运算符+、+=、==，直接实现复数对象间的运算，测试结果-Complex type definition, through the member function overloading operator- (for negative), =,! =, through a friend function overloaded operators+,+ =, = =, direct implementation of com