登录
首页 » matlab » Laguerre-fitting

Laguerre-fitting

于 2014-01-02 发布 文件大小:2KB
0 210
下载积分: 1 下载次数: 13

代码说明:

  基于Laguerre多项式的拟合程序,可以控制多项式的结束,以及变量alpha。(Based on Laguerre polynomial fitting procedure, you can control the end of polynomials, and variable alpha.)

文件列表:

Laguerre拟合程序
................\exp_data.m,1472,2013-12-26
................\fit_measured_data.m,1197,2013-12-26
................\main.m,103,2013-12-26

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • shengxianchangdu
    程序计算在声速梯度下水中声线的传播并计算声线的长度(Program calculates the velocity gradient in the water line of acoustic sound propagation and calculate the length of the line)
    2021-04-23 14:28:47下载
    积分:1
  • rungekutta
    说明:  用于非线性常微分方程的解的重要的一类隐式或显式迭代法,使用龙格库塔计算激光器的速率方程。(An important class of implicit or explicit iterative methods for solving nonlinear ordinary differential equations is to use Runge Kutta to calculate the rate equations of lasers.)
    2020-07-28 21:38:46下载
    积分:1
  • CalcActivationCode
    岩土数值模拟计算的程序,可以用来计算边坡、岩石稳定性。(Numerical simulation of geotechnical calculation program can be used to calculate the slope, rock stability.)
    2015-08-17 12:25:56下载
    积分:1
  • 4zeyunsuan
    复数的四则运算完整版,包括加减乘除,阶乘,开方等。。。(The plural arithmetic full version,, including addition, subtraction, multiplication, and division factorial, prescribing, etc...)
    2013-10-11 16:41:48下载
    积分:1
  • 11087 统逆序对
    Description 设a[0…n-1]是一个包含n个数的数组,若在i<j的情况下,有a[i]>a[j],则称(i, j)为a数组的一个逆序对(inversion)。 比如 <2,3,8,6,1> 有5个逆序对。请采用类似“合并排序算法”的分治思路以O(nlogn)的效率来实现逆序对的统计。 一个n个元素序列的逆序对个数由三部分构成: (1)它的左半部分逆序对的个数,(2)加上右半部分逆序对的个数,(3)再加上左半部分元素大于右半部分元素的数量。 其中前两部分(1)和(2)由递归来实现。要保证算法最后效率O(nlogn),第三部分(3)应该如何实现? 此题请勿采用O(n^2)的简单枚举算法来实现。 并思考如下问题: (1)怎样的数组含有最多的逆序对?最多的又是多少个呢? (2)插入排序的运行时间和数组中逆序对的个数有关系吗?什么关系? 输入格式 第一行:n,表示接下来要输入n个元素,n不超过10000。 第二行:n个元素序列。 输出格式 逆序对的个数。 输入样例 5 2 3 8 6 1 输出样例 5(Set a[0... N-1] is a n array containing n numbers. If there is a [i] > a [j] i n the case of I < j, then (i, j) is a n inversion pair of a array. For example, <2,3,8,6,1> has five reverse pairs. Please use the idea of "merge sorting algorithm" to achieve the statistics of inverse pairs with O (nlogn) efficiency. The number of inverse pairs of a sequence of n elements consists of three parts: (1) The number of reverse pairs in the left half, (2) the number of reverse pairs in the right half, (3) the number of elements in the left half is greater than that in the right half. The first two parts (1) and (2) are implemented by recursion. To ensure the final efficiency of the algorithm O (nlogn), how should the third part (3) be implemented? Do not use O (n ^ 2) simple enumeration algorithm to solve this problem.)
    2019-01-07 23:52:06下载
    积分:1
  • Regularization-Method
    正则化方法包括Tikhonov,tsvd,ttls,tgsvd,csvd(Regularization Method include Tikhonov,tsvd,ttls,tgsvd,csvd.)
    2012-03-05 23:28:02下载
    积分:1
  • NewMatlab
    润滑理论的matlab求解程序,包括弹流和刚流润滑.(Lubrication theory matlab solving procedures, including Elastohydrodynamic lubrication and just.)
    2020-07-01 08:20:02下载
    积分:1
  • erfenfa
    二分法,用于多项式求解,迭代12次能达到很高的精度(Dichotomy for polynomial solving, iterative 12 times to achieve high precision)
    2008-01-25 19:58:10下载
    积分:1
  • NumericalCalEField
    书籍工程电磁场数值计算,包括有限差分法、有限元法、矩量法和边界元法以及电磁场的逆问题(Engineering books electromagnetic field numerical calculation, including the inverse problem of the finite difference method, finite element method, the method of moments and the boundary element method, and electromagnetic fields)
    2012-12-04 21:34:03下载
    积分:1
  • rkf45
    fortran90程序,运用Runge-Kutta法数值求解常微分方程的程序,非常适用,包括源代码、一个算例和输出程序(fortran90 procedures, the use of Runge-Kutta method for numerical solution of ordinary differential equations of the process, is very applicable, including source code, a numerical example and output procedures)
    2009-09-17 02:05:54下载
    积分:1
  • 696516资源总数
  • 106783会员总数
  • 25今日下载