Stanford University Department of Computer Science
Overview
Works:  2 works in 2 publications in 1 language and 1 library holdings 

Publication Timeline
.
Most widely held works by
Stanford University
Constraint propagation techniques for theorydriven data interpretation by
Thomas Glen Dietterich(
Book
)
1 edition published in 1984 in English and held by 1 WorldCat member library worldwide
1 edition published in 1984 in English and held by 1 WorldCat member library worldwide
Adaptive mesh refinement for hyperbolic partial differential equations by
Marsha J Berger(
Book
)
1 edition published in 1982 in English and held by 0 WorldCat member libraries worldwide
In many time dependent simulations, the solution on most of the domain will be fairly smooth, with discontinuities or highly oscillatory phenomena occurring over only a small fraction of the domain. In problems such as these, a mesh refinement approach can be the most efficient, and often the only practical, solution method. Refined grids with smaller and smaller mesh spacing are placed only where they are needed. Since we are solving a time dependent problem, the regions needing refinement will change, and therefore our grids must adapt with time as well. This thesis presents a method based on the idea of multiple, component girds for the solution of hyperbolic partial differential equations(pde) using explicit finite difference techniques. Based upon Richardsontype estimates of the local truncation error, refined grids are created or existing ones removed to attain a given accuracy for a minimum amount of work. In addition, this approach is recursive in that fine grids can themselves contain even finer subgrids. Those grids with finer mesh width is space will also have a smaller mesh width in time, making this is a mesh refinement algorithm in time and space
1 edition published in 1982 in English and held by 0 WorldCat member libraries worldwide
In many time dependent simulations, the solution on most of the domain will be fairly smooth, with discontinuities or highly oscillatory phenomena occurring over only a small fraction of the domain. In problems such as these, a mesh refinement approach can be the most efficient, and often the only practical, solution method. Refined grids with smaller and smaller mesh spacing are placed only where they are needed. Since we are solving a time dependent problem, the regions needing refinement will change, and therefore our grids must adapt with time as well. This thesis presents a method based on the idea of multiple, component girds for the solution of hyperbolic partial differential equations(pde) using explicit finite difference techniques. Based upon Richardsontype estimates of the local truncation error, refined grids are created or existing ones removed to attain a given accuracy for a minimum amount of work. In addition, this approach is recursive in that fine grids can themselves contain even finer subgrids. Those grids with finer mesh width is space will also have a smaller mesh width in time, making this is a mesh refinement algorithm in time and space
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Dietterich, Thomas G. (Thomas Glen) Author
 Berger, M. J. Author
Alternative Names
Stanford University School of Humanities and Sciences Department of Computer Science
Languages