/* * EULER S ALGORITHM 5.1 * * TO Approximate THE SOLUTION OF THE INITIAL VALUE PROBLEM: * Y = F(T,Y), A<=T<=B, Y(A) = ALPHA, * AT N+1 EQUALLY SPACED POINTS IN THE INTERVAL [A,B]. * * INPUT: ENDPOINTS A,B INITIAL CONDITION ALPHA INTEGER N. * * OUTPUT: APPROXIMATION W TO Y AT THE (N+1) VALUES OF T. */
標(biāo)簽： Approximate ALGORITHM THE SOLUTION
上傳時(shí)間： 2015-08-20
上傳用戶：zhangliming420
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]
標(biāo)簽： Approximate directory algorithm the
上傳時(shí)間： 2014-01-17
上傳用戶：hanli8870
The toolbox solves a variety of Approximate modeling problems for linear static models. The model can be parameterized in kernel, image, or input/output form and the approximation criterion, called misfit, is a weighted norm between the given data and data that is consistent with the model. There are three main classes of functions in the toolbox: transformation functions, misfit computation functions, and approximation functions. The approximation functions derive an Approximate model from data, the misfit computation functions are used for validation and comparison of models, and the transformation functions are used for deriving one model representation from another. KEYWORDS: Total least squares, generalized total least squares, software implementation.
標(biāo)簽： Approximate The modeling problems
上傳時(shí)間： 2013-12-20
上傳用戶：15071087253
an Approximate SVM solver, useful for very large dataset.
標(biāo)簽： Approximate dataset solver useful
上傳時(shí)間： 2013-12-16
上傳用戶：fnhhs
Computes Approximate significance points of a Pearson curve with given first four moments, or first three moments and left or right boundary
標(biāo)簽： first significance Approximate Computes
上傳時(shí)間： 2014-06-29
上傳用戶：silenthink
This program calculates Approximate Entropy of a given time series. Approximate Entropy is a statistic which is used to predict the regularity in agiven time series. Apen( Approximate entropy ) is a recently developed method highly used in biomedical applications.
標(biāo)簽： Approximate Entropy calculates program
上傳時(shí)間： 2013-12-27
上傳用戶：電子世界
This is a article about Approximate entropy. It will be helpful for motor behavior and rehabilitation study.
標(biāo)簽： rehabilitati Approximate behavior article
上傳時(shí)間： 2013-12-23
上傳用戶：450976175
This is Approximate entropy and sample entropy article. It will be helpful for motor behavior and rehabilitation study.
標(biāo)簽： entropy Approximate and behavior
上傳時(shí)間： 2014-01-14
上傳用戶：1101055045
genetic algorithm (or GA) is a search technique used in computing to find true or Approximate solutions to optimization and search problems for function of 2 variable
標(biāo)簽： Approximate algorithm computing technique
上傳時(shí)間： 2017-07-25
上傳用戶：225588
Approximate reinforcement learning
標(biāo)簽： reinforcement Approximate learning
上傳時(shí)間： 2014-01-05
上傳用戶：a6697238
蟲(chóng)蟲(chóng)下載站版權(quán)所有 京ICP備2021023401號(hào)-1
