Computational Grids: Generations, Adaptation & Solution Strategies
CRC Press, 1997. gada 1. maijs - 472 lappuses
In this comprehensive volume a treatment of grid generation, adaptive refinement, and redistribution techniques is developed together with supporting mathematical, algorithmic, and software concepts. Efficient solution strategies that exploit grid hierarchies are also described and analyzed. Emphasis is on the fundamental ideas, but the presentation includes practical guidelines for designing and implementing grid strategies.
Lietotāju komentāri - Rakstīt atsauksmi
Ierastajās vietās neesam atraduši nevienu atsauksmi.
adaptive refinement adjacent algorithm applied approach approximation associated basis basis functions becomes boundary calculations Chapter computed condition consider constraint constructed continuous convergence coordinate corresponding curve data structure defined derivative determine developed diagonal difference dimensions direction discretization domain edge effect equation error error indicator estimate example extended Figure Finally finite element follows formula function given global grading grid points Hence ideas implies increasing initial integration interface interior interpolation introduced involves iteration layer leads linear lines matrix mesh method moving nodal nodes norm Note obtained operator optimal polynomial problem procedure produce projection properties provides quadratic quadrilateral redistribution reduced reference refinement region requires residual respectively result satisfies scheme side similar similarly singular smooth solution solved space specified squares step strategy subdomain surface techniques term tetrahedral tion transformation triangle uniform values vector vertices