登录
首页 » Visual C++ » BICG

BICG

于 2012-07-09 发布 文件大小:2KB
0 309
下载积分: 1 下载次数: 28

代码说明:

  BICG算法,是Krylov子空间的迭代方法之一(The BICG algorithm is one of the Krylov subspace iteration method)

文件列表:

BICG
....\arnoldi.m,570,2008-04-29
....\QEP2.m,930,2012-07-07
....\SOAR.m,1259,2012-07-07

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

发表评论

0 个回复

  • wolfe
    wolfe程序模块的C++算法,可以重复使用,对于解决一维搜索是很好的..(C++ algorithm wolfe program modules can be reused for solving one-dimensional search is good ..)
    2014-02-25 15:11:57下载
    积分:1
  • calculator
    用mfc实现计算器的基本操作,支持键盘输入,并保留xp风格,可计算平方,幂,时间显示等操作(With mfc achieve the basic operation of the calculator, support for keyboard input, and retain xp style, calculates the square, power, time display and other operations)
    2013-10-23 15:22:24下载
    积分:1
  • Ansys-bridge
    ANSYS 分析一座预应力连续刚构桥的命令流,很实用哦(ANSYS analysis of a prestressed continuous rigid frame bridge command stream, and very practical!)
    2012-05-30 12:01:35下载
    积分:1
  • computing-theory-introduction
    《计算理论导引》(作者)[美] Michael Sipser(译者)张立昂 王捍贫 黄雄 机械工业2000年2月第1版.pdf(Computational Theory,(Author) [America] Michael Sipser (translator) Zhang Li Ang Wang Hanpin Wong Hung Machinery Industry in February 2000 1st edition. Pdf)
    2013-09-09 21:01:11下载
    积分:1
  • R-K
    四阶龙格库塔法,用C++编写,很有参考价值(Fourth-order Runge-Kutta method, written in C, a good reference)
    2011-12-29 20:44:34下载
    积分:1
  • 3
    说明:  用刷选法求出100之内的素数。并输出数有多少个。(100 prime number is calculated by the method of selection. And the output count how many.)
    2013-09-11 19:40:35下载
    积分:1
  • na7
    Orthogonal Polynomials Approximation 数值分析,计算正交基多项式的系数 (Given a function f and a set of m >0 distinct points . You are supposed to write a function to approximate f by an orthogonal polynomial using the exact function values at the given m points with a weight assigned to each point . The total error must be no larger than a given tolerance. Format of function int OPA( double (*f)(double t), int m, double x[], double w[], double c[], double*eps ) where the function pointer double (*f)(double t) defines the function f int m is the number of points double x[] contains points double w[] contains the values of a weight function at the given points x[] double c[] contains the coefficients of the approximation polynomial double*eps is passed into the function as the tolerance for the error, and is supposed to be returned as the value of error. The function OPA is supposed to return the degree of the approximation polynomial. Note: a constant Max_n is defined so that if the total error is still not small enough when n = Ma)
    2011-11-27 11:47:21下载
    积分:1
  • erfenfa
    二分法,用于多项式求解,迭代12次能达到很高的精度(Dichotomy for polynomial solving, iterative 12 times to achieve high precision)
    2008-01-25 19:58:10下载
    积分:1
  • SerieAritmetica
    Una serie aritmetica en visual basic!!
    2011-09-09 06:49:44下载
    积分:1
  • Matrix
    很好用的有关矩阵的各种操作,包括求逆,特征值,特征向量,svd分解等(good part of the matrix of various operations including inverse, eigenvalues, eigenvectors, svd decomposition, etc.)
    2020-10-31 16:39:55下载
    积分:1
  • 696518资源总数
  • 106259会员总数
  • 28今日下载