◼ Chapter 13 Backtracking ◼ Chapter 14 Randomized Algorithms ◼ Chapter 15 Approximation Algorithms

◼ Chapter 8 The Greedy Approach ◼ Chapter 9 Graph Traversal

◼ Chapter 5 Induction ◼ Chapter 6 Divide and Conquer ◼ Chapter 7 Dynamic Programming

西安电子科技大学：《算法设计技术 Algorithms Design Techniques》课程教学资源（PPT课件讲稿）Chapter 01 Basic Concepts in Algorithmic Analysis（主讲：刘静）

中国科学技术大学：《并行计算 Parallel Computing》课程教学资源（习题）第六章 并行算法的基本设计技术

he finite element Metnod Overcome limitations of Rita Simple basis functions( ow order polyuouisls) Basisfonctians supported in sdo domains(fuite elemnet Basis functions constructed to provide interpolant of proximate soluton Undetermined beraweters represent vales of dead

the finite derwent meThod Ir position of boundary conditions(olis plcewent) We had obtained the aesewbed finite element eeve Kik2∞ Kht K Ki

Which of the following are real problems with the ritz method 1. Selection of basis functions for general ge- metres 2. Lack of systematic procedure to compute stiff atrix and forcing terms

《过程设备设计基础》课程教学资源（相关标准文献）HG20652-1998 塔器设计技术规定

美国麻省理工大学：《结构分析与设计技术》教学资源（讲义）notes121