Polynomial Root Finder is a reliable and fast C program (+ Matlab gateway) for finding all roots of a complex polynomial.
标签： Polynomial reliable gateway finding
上传时间： 2015-04-03
上传用户：15071087253
Training embedded apps to process speech may be as easy as finding the right 8-bit micro. Don t let what Rodger has to say about using an ADPCM algorithm and PWM output to generate speech to go in one ear and out the other
标签： Training embedded process finding
上传时间： 2014-01-26
上传用户：plsee
providing learners for programming with C51, and joining in these web,hopefully finding people with C51 programming so that it will can be studied each other.
标签： with programming providing hopefully
上传时间： 2015-06-22
上传用户：tedo811
A hill climbing algorithm for finding the minimum of a function fitnessfun in the real space.
标签： fitnessfun algorithm the climbing
上传时间： 2013-12-17
上传用户：www240697738
finding FWHM. Full-Width at Half-Maximum (FWHM) of the waveform.
标签： FWHM Half-Maximum Full-Width waveform
上传时间： 2016-01-28
上传用户：zhangyi99104144
FSK信号鉴频的程序.This program implements the function of finding out the largest and the second largest values of the sequence of "in_buffer[10]"
标签： largest the implements function
上传时间： 2016-02-05
上传用户：youth25
An object-oriented C++ implementation of Davidson method for finding a few selected extreme eigenpairs of a large, sparse, real, symmetric matrix
标签： object-oriented implementation Davidson eigenpai
上传时间： 2014-01-09
上传用户：TRIFCT
direction finding Algorithm of ESPRIT Demo
标签： direction Algorithm finding ESPRIT
上传时间： 2016-03-02
上传用户：l254587896
matlab code for direction finding algorithm of MUSIC
标签： algorithm direction finding matlab
上传时间： 2014-01-01
上传用户：498732662
this directory contains the following: * The acdc algorithm for finding the approximate general (non-orthogonal) joint diagonalizer (in the direct Least Squares sense) of a set of Hermitian matrices. [acdc.m] * The acdc algorithm for finding the same for a set of Symmetric matrices. [acdc_sym.m](note that for real-valued matrices the Hermitian and Symmetric cases are similar however, in such cases the Hermitian version [acdc.m], rather than the Symmetric version[acdc_sym] is preferable. * A function that finds an initial guess for acdc by applying hard-whitening followed by Cardoso s orthogonal joint diagonalizer. Note that acdc may also be called without an initial guess, in which case the initial guess is set by default to the identity matrix. The m-file includes the joint_diag function (by Cardoso) for performing the orthogonal part. [init4acdc.m]
标签： approximate directory algorithm the
上传时间： 2014-01-17
上传用户：hanli8870
