HIGH‐ORDER POSITIVE, MONOTONE AND CONVEX MULTIGRID INTERPOLATIONS
DOI10.1108/EB010335zbMATH Open0774.65003OpenAlexW2007757021MaRDI QIDQ5288312FDOQ5288312
Rudolph Lorentz, Wolfgang Joppich
Publication date: 2 September 1993
Published in: COMPEL: The International Journal for Computation and Mathematics in Electrical and Electronic Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1108/eb010335
Recommendations
- Positive, monotone, and \(S\)-convex \(C^ 1\)-interpolation on rectangular grids
- Nonlinear Positive Interpolation Operators for Analysis with Multilevel Grids
- High dimensional polynomial interpolation on sparse grids
- Positive and S-convex C1-interpolation of gridded three dimensional data
- Multigrid algorithms for high order discontinuous Galerkin methods
- Mixed-order interpolation for the Galerkin coarse-grid approximations in algebraic multigrid solvers
- Multistep high-order interpolants of Runge-Kutta methods
- High-order linear multistep methods with general monotonicity and boundedness properties
- High-order, multidimensional, and conservative coarse-fine interpolation for adaptive mesh refinement
- Higher Order Multi-Grid Methods
numerical resultsmultigridshape preserving interpolationnested iterationpositive, monotone, and convex interpolants
Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Numerical interpolation (65D05)
Cites Work
Cited In (2)
This page was built for publication: HIGH‐ORDER POSITIVE, MONOTONE AND CONVEX MULTIGRID INTERPOLATIONS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5288312)
