zbMATH — the first resource for mathematics

Fast optimization-based conservative remap of scalar fields through aggregate mass transfer. (English) Zbl 1349.65054
Summary: We develop a fast, efficient and accurate optimization-based algorithm for the high-order conservative and local-bound preserving remap (constrained interpolation) of a scalar conserved quantity between two close meshes with the same connectivity. The new formulation is as robust and accurate as the flux-variable flux-target optimization-based remap (FVFT-OBR) yet has the computational efficiency of an explicit remapper. The coupled system of linear inequality constraints, resulting from the flux form of remap, is the main efficiency bottleneck in FVFT-OBR. While advection-based remappers use the flux form to directly enforce mass conservation, the optimization setting allows us to treat mass conservation as one of the constraints. To take advantage of this fact, we consider an alternative mass-variable mass-target (MVMT-OBR) formulation in which the optimization variables are the net mass updates per cell and a single linear constraint enforces the conservation of mass. In so doing we change the structure of the OBR problem from a global linear-inequality constrained QP to a singly linearly constrained QP with simple bounds. Using the structure of the MVMT-OBR problem, and the fact that in remap the old and new grids are close, we are able to develop a simple, efficient and easily parallelizable optimization algorithm for the primal MVMT-OBR QP. Numerical studies on a variety of affine and non-affine grids confirm that MVMT-OBR is as accurate and robust as FVFT-OBR, but has the same computational cost as the explicit, state-of-the-art FCR.

65D05 Numerical interpolation
49M20 Numerical methods of relaxation type
Full Text: DOI
[1] Bochev, P.; Ridzal, D.; Scovazzi, G.; Shashkov, M., Formulation, analysis and numerical study of an optimization-based conservative interpolation (remap) of scalar fields for arbitrary Lagrangian-Eulerian methods, Journal of Computational Physics, 230, 5199-5225, (2011) · Zbl 1416.65496
[2] Bochev, P.; Ridzal, D.; Scovazi, G.; Shashkov, M., Constrained optimization based data transfer - a new perspective on flux correction, (Kuzmin, D.; Lohner, R.; Turek, S., Flux-Corrected Transport, Principles, Algorithms and Applications, (2012), Springer Verlag Berlin, Heidelberg), 345-398
[3] Hirt, C.; Amsden, A.; Cook, J., An arbitrary Lagrangian-Eulerian computing method for all flow speeds, Journal of Computational Physics, 14, 227-253, (1974) · Zbl 0292.76018
[4] Peery, J. S.; Carroll, D. E., Multi-material ale methods in unstructured grids, Computer Methods in Applied Mechanics and Engineering, 187, 591-619, (2000) · Zbl 0980.74068
[5] Colella, P., Multidimensional upwind methods for hyperbolic conservation laws, Journal of Computational Physics, 87, 171-200, (1990) · Zbl 0694.65041
[6] Benson, D. J., Computational methods in Lagrangian and Eulerian hydrocodes, Computer Methods in Applied Mechanics and Engineering, 99, 235-394, (1992) · Zbl 0763.73052
[7] Loubere, R.; Shashkov, M. J., A subcell remapping method on staggered polygonal grids for arbitrary-Lagrangian-Eulerian methods, Journal of Computational Physics, 209, 105-138, (2005) · Zbl 1329.76236
[8] Loubere, R.; Staley, M.; Wendroff, B., The repair paradigm: new algorithms and applications to compressible flow, Journal of Computational Physics, 211, 385-404, (2006) · Zbl 1138.76406
[9] Liska, R.; Shashkov, M.; Váchal, P.; Wendroff, B., Optimization-based synchronized flux-corrected conservative interpolation (remapping) of mass and momentum for arbitrary Lagrangian-Eulerian methods, Journal of Computational Physics, 229, 1467-1497, (2010) · Zbl 1329.76269
[10] Coleman, T. F.; Hulbert, L. A., A globally and superlinearly convergent algorithm for convex quadratic programs with simple bbounds, SIAM Journal on Optimization, 3, 298-321, (1993) · Zbl 0778.90051
[11] Margolin, L. G.; Shashkov, M., Second-order sign-preserving conservative interpolation (remapping) on general grids, Journal of Computational Physics, 184, 266-298, (2003) · Zbl 1016.65004
[12] L. Margolin, M. Shashkov, Second-order sign-preserving remapping on general grids, Technical Report LA-UR-02-525, Los Alamos National Laboratory, Los Alamos NM 87545, 2003. · Zbl 1016.65004
[13] Dai, Y.-H.; Fletcher, R., New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds, Mathematical Programming, 106, 403-421, (2006) · Zbl 1134.90030
[14] Nocedal, J.; Wright, S. J., Numerical optimization, (1999), Springer Verlag Berlin, Heidelberg, New York, first ed. · Zbl 0930.65067
[15] Dennis, J. E.; Schnabel, R. B., Numerical methods for nonlinear equations and unconstrained optimization, (1996), SIAM Philadelphia · Zbl 0847.65038
[16] LeVeque, R. J., High-resolution conservative algorithms for advection in incompressible flow, SIAM Journal on Numerical Analysis, 33, 627-665, (1996) · Zbl 0852.76057
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.