登录
首页 » Others » matlab使用有限元方法求解偏微分方程

matlab使用有限元方法求解偏微分方程

于 2020-11-05 发布
0 215
下载积分: 1 下载次数: 2

代码说明:

大量的有限元法求解偏微分方程的实例程序,程序里有详细的解释语句

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

发表评论

0 个回复

  • 易语言远控制源码 - 完整版,绝对好用强大 
    一款易语言远程控制源码 完整版 本来不是完整的 但是经过我小小的艰辛万苦就收集好了 远控的画面也挺好看我觉的 源码对大家绝对有帮助
    2020-12-04下载
    积分:1
  • matlab 二分法 源代码.m
    【实例简介】matlab 二分法 源代码 ,能够快速全面的解决二分法的解题步骤
    2021-12-04 00:40:25下载
    积分:1
  • D_star Lite.zip
    D* Lite路径规划算法,可以在源代码中修改地图大小、起始点、目标点、四向或八向搜寻,算法随机生成原始地图和实际地图,路径规划过程中根据实际障碍物情况改变生成路径。
    2020-07-04下载
    积分:1
  • Spring boot -- 基于AngularJS的网络商城系统
    基于Maven环境下使用Spring boot作为后台开发框架,使用AngularJS作为前台开发框架,控制前台页面,实现页面多视图模块化,真正实现页面跳转更改路径不刷新效果,这是Ajax无法实现的功能。
    2020-06-26下载
    积分:1
  • java仿美团
    使用java jsp开发的仿美团网的小项目
    2020-11-28下载
    积分:1
  • MIPI DSI CSI Dphy协议规范大全.rar
    【实例简介】本压缩包包含了MIPI DSI Specification_v1-3、MIPI_D-PHY_specification_v1-2、MIPI_CSI-2_specification_v1-3等常用的协议
    2021-11-21 00:53:32下载
    积分:1
  • matlab写单纯形法及灵敏度分析
    内部出了有matlab程序外还提供了详细的文档说明,两个对照可以更加清楚的理解单纯形法。。。。
    2020-11-29下载
    积分:1
  • Prony算法谐波分析matlab函数
    Prony算法谐波分析matlab函数,已测试无误,程序使用方法及定义:function [jx,SNR,result]=myprony(x,p,dt)% 实现《电网谐波与间谐波检测的分段Prony算法》郭成 1% 实现《现代信号处理》张贤达P122-124% 实现《Prony算法在谐波、间谐波参数辨识中的应用》式(12) 杨玉坤% intput x:原始数据% intput p:prony模型阶数% intput dt:采样间隔% output jx:拟合数据% output Am:振幅% output Qm:相位% output am:衰减因子% output f
    2020-12-03下载
    积分:1
  • 42步进电机驱动资料
    低噪音、闭环控制等功能的42步进电机驱动资料
    2021-05-06下载
    积分:1
  • Concepts in Programming Languages.pdf
    Concepts in Programming Languages by John Mitchell.一本国外经典教材,看了之后对编程语言更加理解。费了很多劲才找到的。Concepts in Programming LanguagesThis textbook for undergraduate and beginning graduate students explains and examines the central concepts used in modern programminglanguages, such as functions, types, memory management, and controlThe book is unique in its comprehensive presentation and comparisonof major object-oriented programming languages. Separate chapters ex-amine the history of objects, Simula and Smalltalk, and the prominentanguages c++ and JavaThe author presents foundational topics, such as lambda calculus anddenotational semantics, in an easy-to-read, informal style, focusing on themain insights provided by these theories. Advanced topics include concurrency and concurrent object-oriented programming. A chapter on logicprogramming illustrates the importance of specialized programming meth-ods for certain kinds of problemsThis book will give the reader a better understanding of the issuesand trade-offs that arise in programming language design and a betterappreciation of the advantages and pitfalls of the programming languagesthey useJohn C. mitchell is Professor of Computer Science at Stanford University,where he has been a popular teacher for more than a decade. Many of hisformer students are successful in research and private industry. He received his ph D. from mit in 1984 and was a member of technical staff atat&T Bell Laboratories before joining the faculty at Stanford. Over thepast twenty years, Mitchell has been a featured speaker at internationalconferences; has led research projects on a variety of topics, includingprogramming language design and analysis, computer security, and applications of mathematical logic to computer science; and has written morethan 100 research articles. His previous textbook, Foundations for Pro-gramming Languages(MIT Press, 1996), covers lambda calculus, typesystems, logic for program verification, and mathematical semantics ofprogramming languages. Professor Mitchell was a member of the programming language subcommittee of the ACM/ieEE Curriculum 2001standardization effort and the 2002 Program Chair of the aCm principlesof programming languages conferenceCONCEPTS NPROGRAMMINGLANGUAGESJohn c. mitchellStanford UniversityCAMBRIDGEUNIVERSITY PRESSPUBLISHED BY THE PRESS SYNDICATE OF THE UNIVERSITY OF CAMBRIDGEThe Pitt Building, Trumpington Street, Cambridge, United KingdomCAMBRIDGE UNIVERSITY PRESSThe Edinburgh Building, Cambridge CB2 2RU, UK40 West 20th Street, New York, NY 10011-4211 USA477 Williamstown Road, Port Melbourne vic 3207, AustraliaRuiz de alarcon 13, 28014 Madrid, spainDock House, The Waterfront, Cape Town 8001, South Africahttp://www.cambridge.orgo Cambridge university press 2004First published in printed format 2002isBN 0-511-03492-X eBook(adobe readerISBN 0-521-78098-5 hardbackContentsPrefacepage IxPart 1 functions and foundations1 Introduction1.1 Programming Languages1.2 Goals1.3 Programming Language History3561.4 Organization: Concepts and Languages2 Computability2. 1 Partial Functions and computability102.2 Chapter SummaryExercises163 Lisp: Functions, Recursion, and Lists3.1 Lisp History183.2 Good Language design203. 3 Brief Language overview223.4 Innovations in the Design of Lisp253.5 Chapter Summary: Contributions of LispExercises404 Fundamentals484.1 Compilers and syntax484.2 Lambda calculus4.3 Denotational semantics4.4 Functional and Imperative Languages4.5 Chapter SummaryExercisesContentsPart 2 Procedures, Types, Memory Management, and Control5 The algol Family and ML5.1 The Algol Family of Programming Languages5.2 The Development of C5.3 The LCF System and ml5.4 The Ml Programming Language1035.5 Chapter summary121Exercises1226 Type Systems and Type Inference1296.1 Types in Programming1296.2 Type Safety and Type Checking1326.3 Type Inference1356.4 Polymorphism and Overloadin1456.5 Type Declarations and Type Equality1516.6 Chapter Summary155Exercises1567 Scope, Functions, and storage Management1627.1 Block-Structured Languages1627.2 In-Line blocks1657.3 Functions and procedures1707.4 Higher-Order functions1827.5 Chapter summary190Exercises1918 Control in Sequential Languages2048.1 Structured control2048.2 Exceptions2078.3 Continuations2188.4 Functions and evaluation order2238.5 Chapter summary227Exercises8Part 3 Modularity, Abstraction, and object-Oriented Programming9 Data Abstraction and Modularity2359.1 Structured Programming2359.2 Language Support for Abstraction2429.3 Modules9.4 Generic Abstractions2599.5 Chapter Summary269Exercises27110 Concepts in Object-Oriented Languages27710.1 Object-Oriented design27710.2 Four Basic concepts in object-Oriented languages278Contents10.3 Program Structure28810.4 Design Patterns29010.5 Chapter summary29210.6 Looking Forward: Simula, SmalltalkC++Java293Exercises29411 History of objects: Simula and smalltalk30011.1 Origin of Objects in Simula30011.2 Objects in Simula30311.3 Subclasses and Subtypes in Simula30811.4 Development of smalltalk31011.5 Smalltalk Language features31211.6 Smalltalk flexibilit31811.7 Relationship between Subtyping andInheritance2211.8 Chapter SummaryExercises32712 objects and Run-Time Efficiency: C++33712.1 Design goals and Constraints33712.2 Overview of c++34012.3 Classes. Inheritance and Virtual functions34612.4 Subtyping35512.5 Multiple inheritance12.6 Chapter summary366Exercises36713 Portability and Safety: Java38413.1 Java language overview38613.2 Java Classes and Inheritance38913.3 Java Types and Subtyping39613.4 Java System architecture40413.5 Security Features41213.6 Java summary417Exercises420Part 4 Concurrency and Logic Programming14 Concurrent and Distributed Programming43114.1 Basic Concepts in Concurrency43314.2 The actor model44114.3 Concurrent ML14.4 Java concurrency45414.5 Chapter Summary466Exercises469Contents15 The Logic Programming Paradigm and Prolog47515. 1 History of logic Programming15.2 Brief Overview of the logic Programming Paradigm4715. 3 Equations solved by Unification as Atomic Actions15.4 Clauses as Parts of procedure declarations48215.5 Prologs Approach to Programming48615.6 Arithmetic in Prolog49215.7 Control, Ambivalent Syntax, and Meta-Variables49615.8 Assessment of Prolog50515.9 Bibliographic remarks50715.10 Chapter Summary507Appendix a Additional Program Examples509A 1 Procedural and Object-Oriented organization509Glossary521Index525
    2020-12-09下载
    积分:1
  • 696518资源总数
  • 106164会员总数
  • 18今日下载