电子文档交易市场
安卓APP | ios版本
电子文档交易市场
安卓APP | ios版本

算法课件全121301ADA12变治法高斯消去法与多项式计算

21页
  • 卖家[上传人]:E****
  • 文档编号:91095549
  • 上传时间:2019-06-21
  • 文档格式:PPT
  • 文档大小:285.50KB
  • / 21 举报 版权申诉 马上下载
  • 文本预览
  • 下载提示
  • 常见问题
    • 1、Transform and Conquer (I),Chapter 6,Introduction to Transform-and-Conquer Its Application to Numerical Problem Linear Equation Calculating Polynomials,2019/6/21,3,2012-2013-01 Design and Analysis of Algorithm SCUN,Goals of the Lecture,At the end of this lecture, you should Master the basic idea and all kinds of variations of transform and conquer technique Master the linear equation solving algorithm and its analysis Master the Polynomials calculating algorithm and its analysis,2019/6/21,4,2012-

      2、2013-01 Design and Analysis of Algorithm SCUN,Transform and Conquer (basic idea),Second, the modified instance is solved, we call this as a conquering stage,Original instance,More amenable instance,Solution,transform,conquer,Transform and conquer deals with a group of design methods that are based on the idea of transformation,First, the original problems instance is modified to be more amenable to solve, we call this as a transformation stage,2019/6/21,5,2012-2013-01 Design and Analysis of Algo

      3、rithm SCUN,3 Types of Transform and Conquer,Computing the least common multiple Linear programming,Instance simplification: Transform to a simpler/more convenient instance of the same problem,Presorting Solving linear equation,Representation change: Transform to a different representation of the same instance,Calculating polynomial Heap sort,Problem reduction: Transform to a different problem for which an algorithm is already available,2019/6/21,6,2012-2013-01 Design and Analysis of Algorithm SC

      4、UN,Instance simplification - Presorting,Also: Presorting is used in many geometric algorithms.,Many problems involving lists are easier when list is sorted.,searching,computing a mode,checking if all elements are distinct (element uniqueness),a value that occurs most often in a given list of numbers,2012-2013-01 Design and Analysis of Algorithm SCUN,Instance simplification: Linear equation Examples and General form(p203-208),Standard method (cramer method),Example: How to solve the problem of ch

      5、ickens and rabbits in the same cage?,Generally, a system of linear equations is a set of n equations with n unknown variables. Typically these equations can be written as: a11x1 + a12x2 + + a1nxn = b1 a21x1 + a22x2 + + a2nxn = b2 . an1x1 + an2x2 + + annxn = bn,2012-2013-01 Design and Analysis of Algorithm SCUN,Instance simplification: Linear equation Gauss Method,Solve the latter by substitutions starting with the last equation and moving up to the first one (Backward substitution),Transform to:

      6、 An equivalent system of n linear equations in n unknowns with an upper triangular coefficient matrix (Elimination),2012-2013-01 Design and Analysis of Algorithm SCUN,Instance simplification: Linear equation Elimination process,So the result would be:,From the first row to last row (k=1,2,n), we do the following transform (elementary operations):,2012-2013-01 Design and Analysis of Algorithm SCUN,Instance simplification: Linear equation Backward substitution process,So the result would be:,From

      7、the last row to the first row (i=n,n-1,1), we can do the following backward substitution:,2012-2013-01 Design and Analysis of Algorithm SCUN,Example of Gauss method,Result: x1= 2, x2 = 1, x3 = 6,Solve 2x1 - 4x2 + x3 = 6 3x1 - x2 + x3 = 11 x1 + x2 - x3 = -3,2012-2013-01 Design and Analysis of Algorithm SCUN,Algorithm Description,void GSElimination(int n, double *a, double *b) int k, i, j; for(k=0; kn; k+) /Elimination process for(j=k+1; jn; j+) akj = akj/akk; bk = bk/akk; for(i=k+1; in; i+) for(j

      8、=k+1; jn; j+) aij = aij - aik*akj; bi = bi - aik*bk; ,2012-2013-01 Design and Analysis of Algorithm SCUN,Algorithm Description (cont.),/Backward substitution process for(i=n-2; i=0; i-) for(j=i+1; jn; j+) bi = bi - aij*bj; / end of algorithm,2019/6/21,14,2012-2013-01 Design and Analysis of Algorithm SCUN,Algorithm analysis,So the total numbers of multiplications is:,The elimination process,The backward substitution process,2019/6/21,15,2012-2013-01 Design and Analysis of Algorithm SCUN,Thinking,

      9、Is the algorithm described before always correct?,No. If Ai,i=0, we can not divide by it and hence cannot use the ith row as a pivot for the ith iteration of the algorithm,How to fix the above problem?,We can use the first elementary transformation to exchange the ith row with some row below it that has a nonzero coefficient in the ith column.,Has any other problem?,Yes. If Ai,i is so small and consequently the scaling factor Aj,i/Ai,i so large that the new value of Aj,k might become distorted by a round-off error.,How to fix the above problem?,Always look for a row with the largest absolute value of coefficient in the ith column and exchange it with the ith row,16,2012-2013-01 Design and Analysis of Algorithm SCUN,Representation Change Polynomial Evaluat

      《算法课件全121301ADA12变治法高斯消去法与多项式计算》由会员E****分享,可在线阅读,更多相关《算法课件全121301ADA12变治法高斯消去法与多项式计算》请在金锄头文库上搜索。

      点击阅读更多内容
    最新标签
    发车时刻表 长途客运 入党志愿书填写模板精品 庆祝建党101周年多体裁诗歌朗诵素材汇编10篇唯一微庆祝 智能家居系统本科论文 心得感悟 雁楠中学 20230513224122 2022 公安主题党日 部编版四年级第三单元综合性学习课件 机关事务中心2022年全面依法治区工作总结及来年工作安排 入党积极分子自我推荐 世界水日ppt 关于构建更高水平的全民健身公共服务体系的意见 空气单元分析 哈里德课件 2022年乡村振兴驻村工作计划 空气教材分析 五年级下册科学教材分析 退役军人事务局季度工作总结 集装箱房合同 2021年财务报表 2022年继续教育公需课 2022年公需课 2022年日历每月一张 名词性从句在写作中的应用 局域网技术与局域网组建 施工网格 薪资体系 运维实施方案 硫酸安全技术 柔韧训练 既有居住建筑节能改造技术规程 建筑工地疫情防控 大型工程技术风险 磷酸二氢钾 2022年小学三年级语文下册教学总结例文 少儿美术-小花 2022年环保倡议书模板六篇 2022年监理辞职报告精选 2022年畅想未来记叙文精品 企业信息化建设与管理课程实验指导书范本 草房子读后感-第1篇 小数乘整数教学PPT课件人教版五年级数学上册 2022年教师个人工作计划范本-工作计划 国学小名士经典诵读电视大赛观后感诵读经典传承美德 医疗质量管理制度 2 2022年小学体育教师学期工作总结 2022年家长会心得体会集合15篇
    关于金锄头网 - 版权申诉 - 免责声明 - 诚邀英才 - 联系我们
    手机版 | 川公网安备 51140202000112号 | 经营许可证(蜀ICP备13022795号)
    ©2008-2016 by Sichuan Goldhoe Inc. All Rights Reserved.