登录
首页 » Visual C++ » adms

adms

于 2012-06-09 发布 文件大小:3766KB
0 297
下载积分: 1 下载次数: 17

代码说明:

  阿当姆斯显式和隐式求解方法,用四阶龙格库塔作为起始,然后运用四阶阿当姆斯算法求解初值问题。主要程序包含在test2.cpp中,方法简单易懂。编译环境VC2010(Adam James explicit and implicit method for solving fourth-order Runge-Kutta as a start, then use the fourth-order A Williams algorithm for solving initial value problem. The main program contains in test2.cpp method is simple and easy to understand. Compile environment VC2010)

文件列表:

adms
....\adms
....\....\adms.vcxproj,3915,2012-06-06
....\....\adms.vcxproj.filters,943,2012-06-06
....\....\adms.vcxproj.user,143,2012-06-06
....\....\Debug
....\....\.....\adms.exe.embed.manifest,406,2012-06-06
....\....\.....\adms.exe.embed.manifest.res,472,2012-06-06
....\....\.....\adms.exe.intermediate.manifest,381,2012-06-06
....\....\.....\adms.lastbuildstate,48,2012-06-06
....\....\.....\adms.log,2204,2012-06-06
....\....\.....\adms_manifest.rc,198,2012-06-06
....\....\.....\CL.read.1.tlog,9654,2012-06-06
....\....\.....\CL.write.1.tlog,214,2012-06-06
....\....\.....\link-cvtres.read.1.tlog,2,2012-06-06
....\....\.....\link-cvtres.write.1.tlog,2,2012-06-06
....\....\.....\link.5876-cvtres.read.1.tlog,2,2012-06-06
....\....\.....\link.5876-cvtres.write.1.tlog,2,2012-06-06
....\....\.....\link.5876.read.1.tlog,2,2012-06-06
....\....\.....\link.5876.write.1.tlog,2,2012-06-06
....\....\.....\link.read.1.tlog,2562,2012-06-06
....\....\.....\link.write.1.tlog,488,2012-06-06
....\....\.....\mt.read.1.tlog,222,2012-06-06
....\....\.....\mt.write.1.tlog,222,2012-06-06
....\....\.....\rc.read.1.tlog,194,2012-06-06
....\....\.....\rc.write.1.tlog,202,2012-06-06
....\....\.....\test2.obj,62641,2012-06-06
....\....\.....\vc100.idb,232448,2012-06-06
....\....\.....\vc100.pdb,266240,2012-06-06
....\....\test2.cpp,1407,2012-06-06
....\adms.sdf,6639616,2012-06-06
....\adms.sln,879,2012-06-06
....\Debug
....\.....\adms.exe,43008,2012-06-06
....\.....\adms.ilk,535068,2012-06-06
....\.....\adms.pdb,691200,2012-06-06
....\ipch
....\....\adms-feaaced4
....\....\.............\adms-4046af71.ipch,15269888,2012-06-06

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

发表评论

0 个回复

  • fibonacci-heap
    斐波那契堆是一种具有较好平摊时间的堆数据结构。我使用C语言来实现斐波那契堆。(Fibonacci heap is a heap of time with good flat data structure. I am using C language to implement Fibonacci heap.)
    2013-09-17 18:02:59下载
    积分:1
  • SeqQueue
    数据结构循环队列的实现 在visual c++6.0运行(Circular queue data structure to achieve the visual c++6.0 run)
    2013-06-15 16:27:32下载
    积分:1
  • sgu-499
    题意:给你n个数,求出两两组合的最大公约数 类似打素数表的做法 (Meaning of the questions: to give you the number n, find greatest common divisor of a similar combination twenty-two hit the practice table of prime numbers)
    2011-08-30 21:56:59下载
    积分:1
  • josephus
    说明:  约瑟夫算法,适合初步学习数据结构的同学了解递归调用的特点(josephus in C language)
    2011-04-13 16:43:47下载
    积分:1
  • Anorldi
    关于Arnoldi算法的今年来的中文资料,希望能够给有兴趣编写这方面算法的人提供帮助(Arnoldi algorithm on the Chinese data this year, hoping to write this algorithm are interested in helping people)
    2011-10-22 10:26:34下载
    积分:1
  • Data-Structure11-15
    本书是关于计算机科学与工程领域的基础性研究科目之一——数据结构与算法的专著。 本书在简要回顾了基本的C++ 程序设计概念的基础上,全面系统地介绍了队列、堆栈、树、图等基本数据结构,以及贪婪算法、分而治之算法、分枝定界算法等多种算法设计方法,为数据结构与算法的继续学习和研究奠定了一个坚实的基础。更为可贵的是,本书不仅仅介绍了理论知识,还提供了50多个应用实例及600多道练习题。 本书内容广博权威,结构清晰合理,是一本全新的有关数据结构与算法的教材,对于计算机科学与工程领域的从业人员也是一本很好的参考书。 11-15章 (This book is about the field of computer science and engineering subjects of basic research- data structures and algorithms monographs. In a brief review of the book based on the basic concept of C++ programming on a comprehensive and systematic introduction to the queues, stacks, trees, graphs and other basic data structures, and the greedy algorithm, a variety of algorithms divide and conquer algorithms, branch and bound algorithm design method for data structures and algorithms continue to learn and study laid a solid foundation. More valuable is the book not only theoretical knowledge, but also provides more than 50 application examples and more than 600 channel exercises. Book a broad authority, clear and reasonable structure, is a new data structures and algorithms related materials, for the field of computer science and engineering practitioners also a good reference book. Chapter 11-15)
    2014-05-30 09:27:46下载
    积分:1
  • Data-structure
    说明:  分别用堆栈和数组的方法实现任何进制的数制转换(Arrays were used to stack and method of implementation of any binary number system conversion )
    2011-03-08 16:55:07下载
    积分:1
  • xianxingbiaolianjie
    线性表的链接实现可利用单链表来实现,每个节点存储一个元素。 利用单链表来实现线性表的元素的插入,删除,修改等功能。 (Linear link table can be used to achieve a single linked list to implement, each node stores an element. Using a single linked list to implement elements of the linear table insert, delete, modify, and other functions.)
    2011-04-26 11:57:25下载
    积分:1
  • xianxinglianbiao
    c语言编写链式线性表的初始化,创建,插入删除等操作。(c language chained linear table is initialized, create, insert and delete operations.)
    2013-11-09 14:30:30下载
    积分:1
  • 2.2
    已知线性表中的元素以值递增有序排列,并以单链表作存储结构。试写一高效的算法,删除表中所有值大于mink且小于maxk的元素(若表中存在这样的元素)同时释放被删结点空间,并分析你的算法的时间复杂度(注意:mink和maxk是给定的两个参变量,它们的值可以和表中的元素相同,也可以不同)。(Known linear elements in the table to the value increments ordered, and a single list for the storage structure. Try to write a highly efficient algorithm to delete all values ​ ​ greater than mink and maxk elements smaller than (if there is such an element in the table) while the release of the deleted node space, and analyze your time complexity of the algorithm (Note: mink and maxk is given two parameters variables, their values ​ ​ and elements in the table can be the same or different).)
    2015-04-11 23:11:41下载
    积分:1
  • 696518资源总数
  • 106155会员总数
  • 8今日下载