Knowledge

Adaptive mesh refinement

Source đź“ť

43:) is a method of adapting the accuracy of a solution within certain sensitive or turbulent regions of simulation, dynamically and during the time the solution is being calculated. When solutions are calculated numerically, they are often limited to predetermined quantified grids as in the Cartesian plane which constitute the computational grid, or 'mesh'. Many problems in numerical analysis, however, do not require a uniform precision in the numerical grids used for graph plotting or computational simulation, and would be better suited if specific areas of graphs which needed precision could be refined in quantification only in the regions requiring the added precision. Adaptive mesh refinement provides such a dynamic programming environment for adapting the precision of the numerical computation based on the requirements of a computation problem in specific areas of multi-dimensional graphs which need precision while leaving the other regions of the multi-dimensional graphs at lower levels of precision and resolution. 170:, the solution (water height) might only be calculated for points every few feet apart—and one would assume that in between those points the height varies smoothly. The limiting factor to the resolution of the solution is thus the grid spacing: there will be no features of the numerical solution on scales smaller than the grid-spacing. Adaptive mesh refinement (AMR) changes the spacing of grid points, to change how accurately the solution is known in that region. In the shallow water example, the grid might in general be spaced every few feet—but it could be adaptively refined to have grid points every few inches in places where there are large waves. 82:
The image above shows the grid structure of an AMR calculation of a shock impacting an inclined slope. Each of the boxes is a grid; the more boxes it is nested within, the higher the level of refinements. As the image shows, the algorithm uses high resolution grids only at the physical locations and
134:
which advances those cells in time. Finally, a correction procedure is implemented to correct the transfer along coarse-fine grid interfaces, to ensure that the amount of any conserved quantity leaving one cell exactly balances the amount entering the bordering cell. If at some point the level of
157:
Advanced mesh refinement has been introduced via functionals. Functionals allow the ability to generate grids and provide mesh adaptation. Some advanced functionals include the Winslow and modified Liao functionals.
495:"A subcycling/non-subcycling time advancement scheme-based DLM immersed boundary method framework for solving single and multiphase fluid--structure interaction problems on dynamically adaptive grids" 66:. The use of AMR has since then proved of broad use and has been used in studying turbulence problems in hydrodynamics as well as in the study of large scale structures in astrophysics as in the 130:
All tagged cells are then refined, meaning that a finer grid is overlaid on the coarse one. After refinement, individual grid patches on a single fixed level of refinement are passed off to an
204:
In addition, the AMR methods have been developed and applied to a wide range of fluid mechanics problems, including two-phase flows, fluid-structure interactions, and wave energy converters.
79: 115:. As the calculation progresses, individual grid cells are tagged for refinement, using a criterion that can either be user-supplied (for example 190:
Complete control of grid resolution, compared to the fixed resolution of a static grid approach, or the Lagrangian-based adaptivity of
446:"A parallel cell-centered adaptive level set framework for efficient simulation of two-phase flows with subcycling and non-subcycling" 197:
Compared to pre-tuned static meshes, the adaptive approach requires less detailed a priori knowledge on the evolution of the solution.
603: 536:"Reynolds-Averaged Navier--Stokes simulation of the heave performance of a two-body floating-point absorber wave energy system" 353: 245: 135:
refinement in a cell is greater than required, the high resolution grid may be removed and replaced with a coarser grid.
177:
can be used - in which the grid is more finely spaced in some regions than others, but maintains its shape over time.
191: 67: 370: 173:
If the region in which higher resolution is desired remains localized over the course of the computation, then
535: 494: 112: 46:
This dynamic technique of adapting computation precision to specific requirements has been accredited to
445: 313:"Star formation with 3-D adaptive mesh refinement: the collapse and fragmentation of molecular clouds" 124: 167: 147: 270: 457: 412: 285: 108: 8: 400: 25: 461: 416: 289: 516: 475: 32: 17: 329: 312: 568: 520: 479: 349: 297: 241: 21: 551: 511: 578: 573: 547: 506: 465: 420: 324: 293: 237: 88: 96: 55: 588: 222: 470: 424: 597: 92: 51: 47: 138:
This allows the user to solve problems that are completely intractable on a
401:"A quadtree-adaptive multigrid solver for the Serre–Green–Naghdi equations" 143: 139: 223:"Adaptive mesh refinement for hyperbolic partial differential equations" 150:
core down to an effective resolution of 131,072 cells per initial cloud
131: 100: 59: 583: 444:
Zeng, Yadong; Xuan, Anqing; Blaschke, Johannes; Shen, Lian (2022).
200:
The computational costs inherit properties of the physical system.
120: 154:, corresponding to a resolution of 10 cells on a uniform grid. 151: 78: 184:
Increased computational savings over a static grid approach.
161: 116: 73: 271:"Local adaptive mesh refinement for shock hydrodynamics" 187:
Increased storage savings over a static grid approach.
107:. The algorithm begins with the entire computational 16:
This article is about the use of adaptive meshing in
443: 111:
covered with a coarsely resolved base-level regular
180:The advantages of a dynamic gridding scheme are: 595: 493:Zeng, Yadong; Bhala, Amneet; Shen, Lian (2022). 317:Journal of Computational and Applied Mathematics 371:"Grid generation and adaptation by functionals" 123:regions are more highly resolved) or based on 492: 268: 344:Huang, Weizhang; Russell, Robert D. (2010). 343: 269:Berger, Marsha J.; Colella, Philipp (1989). 220: 221:Berger, Marsha J.; Oliger, Joseph (1984). 510: 469: 328: 162:Applications of adaptive mesh refinement 119:per cell remains constant, hence higher 77: 20:. For the use of adaptive techniques in 398: 375:Computational & Applied Mathematics 368: 74:Development of adaptive mesh refinement 596: 310: 146:have used AMR to model a collapsing 533: 166:When calculating a solution to the 13: 251:from the original on July 22, 2021 14: 615: 604:Numerical differential equations 450:Journal of Computational Physics 405:Journal of Computational Physics 278:Journal of Computational Physics 230:Journal of Computational Physics 552:10.1016/j.compfluid.2012.10.007 512:10.1016/j.compfluid.2022.105358 192:smoothed particle hydrodynamics 68:Bolshoi cosmological simulation 534:Yu, Yi-Hsiang; Li, Ye (2013). 527: 486: 437: 392: 369:Khattri, Sanjay Kumar (2007). 362: 337: 304: 262: 214: 105:local adaptive mesh refinement 83:times where they are required. 64:local adaptive mesh refinement 1: 330:10.1016/S0377-0427(99)00156-9 207: 298:10.1016/0021-9991(89)90035-1 242:10.1016/0021-9991(84)90073-1 103:for dynamic gridding called 62:for dynamic gridding called 7: 562: 346:Adaptive Moving Mesh Method 10: 620: 399:Popinet, StĂ©phane (2015). 15: 471:10.1016/j.jcp.2021.110740 425:10.1016/j.jcp.2015.09.009 125:Richardson extrapolation 37:adaptive mesh refinement 311:Klein, Richard (1999). 168:shallow water equations 540:Computers & Fluids 499:Computers & Fluids 175:static mesh refinement 84: 546:. Elsevier: 104–114. 148:giant molecular cloud 95:, Joseph Oliger, and 81: 505:. Elsevier: 105358. 456:. Elsevier: 110740. 462:2022JCoPh.44810740Z 417:2015JCoPh.302..336P 290:1989JCoPh..82...64B 26:Subdivision surface 85: 33:numerical analysis 18:numerical analysis 569:Adaptive stepsize 355:978-1-4419-7916-2 58:who developed an 22:computer graphics 611: 579:Multigrid method 574:Cactus Framework 556: 555: 531: 525: 524: 514: 490: 484: 483: 473: 441: 435: 434: 432: 431: 396: 390: 389: 387: 386: 366: 360: 359: 341: 335: 334: 332: 323:(1–2): 123–152. 308: 302: 301: 275: 266: 260: 259: 257: 256: 250: 227: 218: 619: 618: 614: 613: 612: 610: 609: 608: 594: 593: 565: 560: 559: 532: 528: 491: 487: 442: 438: 429: 427: 397: 393: 384: 382: 367: 363: 356: 342: 338: 309: 305: 273: 267: 263: 254: 252: 248: 225: 219: 215: 210: 164: 144:astrophysicists 142:; for example, 97:Phillip Colella 87:In a series of 76: 56:Phillip Colella 29: 24:modelling, see 12: 11: 5: 617: 607: 606: 592: 591: 589:Silo (library) 586: 581: 576: 571: 564: 561: 558: 557: 526: 485: 436: 391: 361: 354: 336: 303: 261: 236:(3): 484–512. 212: 211: 209: 206: 202: 201: 198: 195: 188: 185: 163: 160: 113:Cartesian grid 75: 72: 9: 6: 4: 3: 2: 616: 605: 602: 601: 599: 590: 587: 585: 582: 580: 577: 575: 572: 570: 567: 566: 553: 549: 545: 541: 537: 530: 522: 518: 513: 508: 504: 500: 496: 489: 481: 477: 472: 467: 463: 459: 455: 451: 447: 440: 426: 422: 418: 414: 410: 406: 402: 395: 380: 376: 372: 365: 357: 351: 347: 340: 331: 326: 322: 318: 314: 307: 299: 295: 291: 287: 283: 279: 272: 265: 247: 243: 239: 235: 231: 224: 217: 213: 205: 199: 196: 193: 189: 186: 183: 182: 181: 178: 176: 171: 169: 159: 155: 153: 149: 145: 141: 136: 133: 128: 126: 122: 118: 114: 110: 106: 102: 99:developed an 98: 94: 93:Marsha Berger 90: 80: 71: 69: 65: 61: 57: 53: 52:Joseph Oliger 49: 48:Marsha Berger 44: 42: 38: 34: 27: 23: 19: 543: 539: 529: 502: 498: 488: 453: 449: 439: 428:. Retrieved 408: 404: 394: 383:. Retrieved 381:(2): 235–249 378: 374: 364: 348:. Springer. 345: 339: 320: 316: 306: 284:(1): 64–84. 281: 277: 264: 253:. Retrieved 233: 229: 216: 203: 179: 174: 172: 165: 156: 140:uniform grid 137: 129: 104: 86: 63: 45: 40: 36: 30: 411:: 336–358. 430:2021-07-22 385:2021-07-22 255:2021-07-22 208:References 132:integrator 521:247369961 480:244203913 101:algorithm 60:algorithm 598:Category 584:Quadtree 563:See also 246:Archived 458:Bibcode 413:Bibcode 286:Bibcode 121:density 519:  478:  352:  152:radius 109:domain 89:papers 54:, and 517:S2CID 476:S2CID 274:(PDF) 249:(PDF) 226:(PDF) 350:ISBN 117:mass 548:doi 507:doi 503:238 466:doi 454:448 421:doi 409:302 325:doi 321:109 294:doi 238:doi 41:AMR 31:In 600:: 544:73 542:. 538:. 515:. 501:. 497:. 474:. 464:. 452:. 448:. 419:. 407:. 403:. 379:26 377:. 373:. 319:. 315:. 292:. 282:82 280:. 276:. 244:. 234:53 232:. 228:. 127:. 91:, 70:. 50:, 35:, 554:. 550:: 523:. 509:: 482:. 468:: 460:: 433:. 423:: 415:: 388:. 358:. 333:. 327:: 300:. 296:: 288:: 258:. 240:: 194:. 39:( 28:.

Index

numerical analysis
computer graphics
Subdivision surface
numerical analysis
Marsha Berger
Joseph Oliger
Phillip Colella
algorithm
Bolshoi cosmological simulation

papers
Marsha Berger
Phillip Colella
algorithm
domain
Cartesian grid
mass
density
Richardson extrapolation
integrator
uniform grid
astrophysicists
giant molecular cloud
radius
shallow water equations
smoothed particle hydrodynamics
"Adaptive mesh refinement for hyperbolic partial differential equations"
doi
10.1016/0021-9991(84)90073-1
Archived

Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.

↑