zoukankan      html  css  js  c++  java
  • 十大算法

    本文内容取自 网页

    一、1946 蒙特卡洛方法

    [1946: John von Neumann, Stan Ulam, and Nick Metropolis, all at the Los Alamos Scientific Laboratory, cook up the Metropolis algorithm, also known as the Monte Carlo method.]

    二、1947 单纯形法

    [1947: George Dantzig, at the RAND Corporation, creates the simplex method for linear programming.]

    三、1950 Krylov子空间迭代法

    [1950: Magnus Hestenes, Eduard Stiefel, and Cornelius Lanczos, all from the Institute for Numerical Analysis at the National Bureau of Standards, initiate the development of Krylov subspace iteration methods.]

    四、1951 矩阵计算的分解方法

    [1951: Alston Householder of Oak Ridge National Laboratory formalizes the decompositional approach to matrix computations.]

    五、1957 优化的Fortran编译器

    [1957: John Backus leads a team at IBM in developing the Fortran optimizing compiler.]

    六、1959-61 计算矩阵特征值的QR算法

    [1959–61: J.G.F. Francis of Ferranti Ltd, London, finds a stable method for computing eigenvalues, known as the QR algorithm.]

    七、1962 快速排序算法

    [1962: Tony Hoare of Elliott Brothers, Ltd., London, presents Quicksort.]

    八、1965 快速傅立叶变换

    [1965: James Cooley of the IBM T.J. Watson Research Center and John Tukey of Princeton University and AT&T Bell Laboratories unveil the fast Fourier transform.]

    九、1977 整数关系探测算法

    [1977: Helaman Ferguson and Rodney Forcade of Brigham Young University advance an integer relation detection algorithm.]

    十、1987 快速多极算法

    [1987: Leslie Greengard and Vladimir Rokhlin of Yale University invent the fast multipole algorithm.]

  • 相关阅读:
    开源框架.netCore DncZeus学习(五)下拉树的实现
    开源框架.netCore DncZeus学习(四)项目升级
    github下载更新代码到本地
    AndroidStudio替换空行
    Ext.net获取选中行数据
    OZCode
    禁止密码显示框
    Android layout_weight理解
    微信页面关于点击按钮关注公众号放到链接里无关注按钮
    进入页面就触发了popstate事件。
  • 原文地址:https://www.cnblogs.com/zhangshihao/p/8006814.html
Copyright © 2011-2022 走看看