偏微分方程的數(shù)值方法：英文版

定　價：￥76.00

作　者：	（）J.W.Thomas著
出版社：	世界圖書出版公司北京公司
叢編項：
標(biāo)　簽：	微積分

購買這本書可以去

ISBN：	9787506272698	出版時間：	2005-06-01	包裝：	簡裝本
開本：	22cm	頁數(shù)：		字數(shù)：

內(nèi)容簡介

　　本書分為兩卷（或者稱為兩部分），分別列入Springer《應(yīng)用數(shù)學(xué)叢書》之22卷和33卷，內(nèi)容取自作者在克羅拉多州立大學(xué)所開的研究生課程講義，該課程講授偏微分方程的差分解法，授課的對象為應(yīng)用數(shù)學(xué)和工程專業(yè)的研究生。本書的特點是強調(diào)實際上機操作，閱讀本書需要一定的偏微分方程基礎(chǔ)知識和編程能力，本書可以作為研究生和高年級大學(xué)生學(xué)習(xí)計算數(shù)學(xué)的教科書。第1卷《數(shù)值偏微分方程——有限差分法》（Numerical Partial Differential Equations： Finite Difference Methods）已購權(quán)影印出版，編號為WB3299。

作者簡介

暫缺《偏微分方程的數(shù)值方法：英文版》作者簡介

圖書目錄

SeriesPreface.
Preface
PrefacetoPart1
ContentsofPart1
StabilityofInitial-Boundary-ValueSchemes
8.1Introduction
8.2Stability
8.2.1Stability:AnEasyCase
8.2.2Stability:AnotherEasyCase
8.2.3GKSO:GeneralTheory
8.2.4LeftQuarterPlaneProblems
8.3ConstructingStableDifferenceSchemes
8.4ConsistencyandConvergence
8.4.1NormsandConsistency
8.4.2ConsistencyofNumericalBoundaryConditions
8.4.3ConvergenceTheorem:Gustafsson
8.5SchemesWithoutNumericalBoundaryConditions
8.6ParabolicInitial-Boundary-ValueProblems
9ConservationLaws
9.1Introduction
9.2TheoryofScalarConservationLaws
9.2.1ShockFormation
9.2.2WeakSolutions
9.2.3DiscontinuousSolutions
9.2.4TheEntropyCondition
9.2.5SolutionofScalarConservationLaws
9.3TheoryofSystemsofConservationLaws
9.3.1SolutionsofPdemannProblems
9.4ComputationalInterludeVI
9.5NumericalSolutionofConservationLaws
9.5.1Introduction
9.6DifferenceSchemesforConservationLaws
9.6.1Consistency
9.6.2ConservativeSchemes
9.6.3DiscreteConservation
9.6.4TheCourant-Friedrichs-LewyCondition
9.6.5Entropy
9.7DifferenceSchemesforScalarConservationLaws
9.7.1Definitions
9.7.2Theorems
9.7.3GodunovScheme
9.7.4HighResolutionSchemes
9.7.5Flux-LimiterMethods
9.7.6Slope-LimiterMethods
9.7.7ModifiedFluxMethod
9.8DifferenceSchemesforK-SystemConservationLaws
9.9GodunovSchemes
9.9.1GodunovSchemesforLinearK-System
ConservationLaws
9.9.2GodunovSchemesforK-SystemConservationLaws
9.9.3ApproximateRiemannSolvers:Theory
9.9.4ApproximateRiemannSolvers:Applications
9.10HighResolutionSchemesforLinearK-System
ConservationLaws
9.10.1Flux-LimiterSchemesforLinearK-System
ConservationLaws
9.10.2Slope-LimiterSchemesforLinearK-System
ConservationLaws
9.10.3AModifiedFluxSchemeforLinearK-System
ConservationLaws
9.10.4HighResolutionSchemesforK-System
ConservationLaws
9.11ImplicitSchemes
9.12DifferenceSchemesforTwoDimensionalConservationLaws..
9.12.1SomeComputationalExamples
9.12.2SomeTwoDimensionalHighResolutionSchemes
9.12.3TheZalesak-SmolarkiewiczScheme
9.12.4AZ-SSchemeforNonlinearConservationLaws
9.12.5TwoDimensionalK-SystemConservationLaws
10EllipticEquations
10.1Introduction
10.2SolvabilityofEllipticDifferenceEquations:Dirichlet
BoundaryConditions
10.3ConvergenceofEllipticDifferenceSchemes:Dirichlet
BoundaryConditions
10.4SolutionSchemesforEllipticDifferenceEquations:
Introduction
10.5ResidualCorrectionMethods
10.5.1AnalysisofResidualCorrectionSchemes
10.5.2JacobiRelaxationScheme
10.5.3AnalysisoftheJacobiRelaxationScheme
10.5.4StoppingCriteria
10.5.5ImplementationoftheJacobiScheme
10.5.6Gauss-SeidelScheme
10.5.7AnalysisoftheGauss-SeidelRelaxationScheme
10.5.8SuccessiveOverrelaxationScheme
10.5.9ElementaryAnalysisofSORScheme
10.5.10MoreontheSORScheme
10.5.11LineJacobi,Gauss-SeidelandSORSchemes
10.5.12Approximatingwb:Reality
10.6EllipticDifferenceEquations:Neumann
BoundaryConditions
10.6.1FirstOrderApproximation
10.6.2SecondOrderApproximation
10.6.3SecondOrderApproximationonanOffsetGrid
10.7NumericalSolutionofNeumannProblems
10.7.1Introduction
10.7.2ResidualCorrectionSchemes
10.7.3JacobiandGauss-SeidelIteration
10.7.4SORScheme
10.7.5Approximationofwb
10.7.6Implementation:NeumannProblems
10.8EllipticDifferenceEquations:MixedProblems
10.8.1Introduction
10.8.2MixedProblems:Solvability
10.8.3MixedProblems:Implementation
10.9EllipticDifferenceEquations:PolarCoordinates
10.10Multigrid
10.10.1Introduction
10.10.2Smoothers
10.10.3GridTransfers
10.10.4MultigridAlgorithm
10.11ComputationalInterludeVII
10.11.1BlockingOut:IrregularRegions
10.11.2HW0.0.4
10.12ADISchemes
10.13ConjugateGradientScheme
10.13.1PreconditionedConjugateGradientScheme
10.13.2SSORasaPreconditioner
10.13.3Implementation
10.14UsingIterativeMethodstoSolveTimeDependentProblems
10.15UsingFFTstoSolveEllipticProblems
10.16ComputationalInterludeVIII
11IrregularRegionsandGrids
11.1Introduction
11.2IrregularGeometries
11.2.1BlockingOut
11.2.9.MaptheRegion
11.2.3GridGeneration
11.3GridRefinement
11.3.1GridRefinement:ExplicitSchemesforHyperbolic
Problems
11.3.2GridRefinementforImplicitSchemes
11.4UnstructuredGrids
References
Index...