pith. sign in

arxiv: 2607.02336 · v1 · pith:KH7EU36Dnew · submitted 2026-07-02 · 🧮 math.NA · cs.NA

Block Preconditioning for Shifted Boundary Method Discretisations of the Stokes Problem

Micha{\l} Wichrowski , Ajay Ajith This is my paper

Pith reviewed 2026-07-03 07:33 UTC · model grok-4.3

classification 🧮 math.NA cs.NA
keywords Shifted Boundary MethodStokes equationsblock preconditioningGMRESfield-of-values analysisnon-symmetric saddle-point problemsmesh-independent convergence
0
0 comments X

The pith

A block preconditioner for SBM Stokes systems treats non-symmetric terms as asymptotically small perturbations, delivering mesh-independent GMRES convergence on fine meshes.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper shows how to build a practical block preconditioner for the non-symmetric linear systems that arise when the Shifted Boundary Method is applied to incompressible Stokes flow. Instead of relying on classical operator theory that requires symmetry, the authors use a field-of-values argument to prove that the extra non-symmetric contributions shrink relative to the main saddle-point operator once the mesh is fine enough to resolve the geometry. If this holds, then a simple choice—the velocity block plus a pressure-mass-matrix approximation to the Schur complement—already produces iteration counts that stay bounded under refinement. Readers care because SBM avoids body-fitted meshing, so scalable solvers open the method to larger, more complex domains without custom mesh generation at every step.

Core claim

The non-symmetric contributions introduced by the Shifted Boundary Method act as asymptotically small perturbations of a standard saddle-point operator; therefore a block preconditioner that employs the velocity block together with a pressure mass matrix as Schur-complement approximation produces mesh-independent GMRES convergence once the mesh captures the geometry.

What carries the argument

The block preconditioner formed from the velocity block and a pressure-mass-matrix Schur-complement approximation, justified by field-of-values analysis that bounds the non-symmetric SBM perturbation.

If this is right

  • Iteration counts stay bounded under uniform mesh refinement for any fixed geometry once the mesh is sufficiently fine.
  • The same preconditioner works without modification across geometries of increasing topological complexity.
  • Iteration counts rise only in the under-resolved coarse-mesh regime and drop once the grid captures the geometry.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same field-of-values perturbation argument could be tested on other immersed or cut-cell formulations that also produce non-symmetric Stokes matrices.
  • The observed coarse-mesh degradation suggests that an adaptive or geometry-aware initial mesh might remove the need for any special coarse-level treatment.
  • Because the analysis separates the perturbation size from the mesh size, the preconditioner may remain effective when the method is extended to time-dependent or nonlinear flow problems.

Load-bearing premise

The non-symmetric terms contributed by the Shifted Boundary Method remain asymptotically small relative to the standard saddle-point operator on meshes that already resolve the geometry.

What would settle it

GMRES iteration counts that continue to grow with successive mesh refinement, even after the mesh has resolved the geometry to the point where the surrogate boundary matches the true boundary within the discretization error.

Figures

Figures reproduced from arXiv: 2607.02336 by Ajay Ajith, Micha{\l} Wichrowski.

Figure 1
Figure 1. Figure 1: Schematic illustrating the background mesh, interior cells (green), the surrogate boundary [PITH_FULL_IMAGE:figures/full_fig_p004_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: The two arrangements and the solution obtained with [PITH_FULL_IMAGE:figures/full_fig_p015_2.png] view at source ↗
read the original abstract

The Shifted Boundary Method (SBM) sidesteps body-fitted meshing by shifting boundary conditions onto a surrogate boundary and correcting for the displacement through Taylor expansions. Despite its broad analysis and application, scalable iterative solvers for the incompressible Stokes equations remain underdeveloped. We present a block preconditioner for SBM--Stokes discretisations that uses the velocity block together with a pressure mass matrix as a Schur complement approximation. Because the SBM system is non-symmetric, classical operator preconditioning does not apply directly; a field-of-values analysis instead shows that the non-symmetric SBM contributions act as asymptotically small perturbations of a standard saddle-point operator, yielding mesh-independent GMRES convergence on sufficiently fine meshes. Numerical experiments demonstrate iteration counts under refinement across geometries of increasing complexity. We expose a coarse-mesh regime in which an under-resolved grid produces elevated iteration counts, an artefact of insufficient resolution that vanishes once the mesh captures the geometry.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 1 minor

Summary. The paper develops a block preconditioner (velocity block plus pressure mass matrix Schur approximation) for the non-symmetric Stokes system obtained from Shifted Boundary Method (SBM) discretizations. A field-of-values argument is used to claim that the non-symmetric SBM contributions (arising from Taylor-shifted boundary conditions) act as asymptotically small perturbations of a standard symmetric saddle-point operator, thereby guaranteeing mesh-independent GMRES convergence once the mesh is fine enough to resolve the geometry. Numerical experiments are reported to show bounded iteration counts under refinement for geometries of increasing complexity, while noting elevated counts on under-resolved coarse meshes.

Significance. If the field-of-values perturbation analysis is made rigorous with explicit rates, the work would supply a practical, theoretically supported preconditioner for SBM applied to incompressible flow problems, addressing a gap in scalable solvers for non-body-fitted discretizations. The explicit identification of a coarse-mesh regime where iteration counts rise is a useful practical contribution.

major comments (2)
  1. [Abstract / theoretical analysis] The central claim rests on the field-of-values analysis showing that non-symmetric SBM terms produce an asymptotically small perturbation whose effect on the numerical range vanishes as h→0. However, no explicit rate (e.g., O(h) or O(h²)) or uniform bound away from the origin/imaginary axis is supplied for the perturbation in the field-of-values inner product, nor is the dependence on the O(h) shift distance quantified; without this the mesh-independence conclusion for GMRES remains unverified.
  2. [Numerical experiments] The abstract states that numerical experiments demonstrate iteration counts under refinement, yet supplies neither data tables, explicit iteration numbers, nor mesh-size sequences, preventing assessment of whether the observed counts remain bounded independently of h once the geometry is resolved.
minor comments (1)
  1. [Abstract] The abstract refers to 'a field-of-values analysis' without indicating the section in which the derivation appears, which would aid readability.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading and constructive comments. The feedback highlights opportunities to strengthen both the theoretical analysis and the presentation of numerical results. We address each major comment below.

read point-by-point responses

  1. Referee: [Abstract / theoretical analysis] The central claim rests on the field-of-values analysis showing that non-symmetric SBM terms produce an asymptotically small perturbation whose effect on the numerical range vanishes as h→0. However, no explicit rate (e.g., O(h) or O(h²)) or uniform bound away from the origin/imaginary axis is supplied for the perturbation in the field-of-values inner product, nor is the dependence on the O(h) shift distance quantified; without this the mesh-independence conclusion for GMRES remains unverified.

    Authors: We agree that the current field-of-values argument establishes asymptotic smallness of the non-symmetric perturbation as h→0 but does not supply an explicit rate or a uniform bound independent of h. This leaves the precise mesh-independence statement for GMRES formally incomplete. In the revised manuscript we will augment the analysis section with a quantitative estimate showing that the perturbation term is O(h) in the field-of-values norm (consistent with the O(h) shift distance), together with a lower bound on the real part of the numerical range that remains positive and bounded away from zero for all sufficiently small h. This will make the mesh-independence claim rigorous. revision: yes

  2. Referee: [Numerical experiments] The abstract states that numerical experiments demonstrate iteration counts under refinement, yet supplies neither data tables, explicit iteration numbers, nor mesh-size sequences, preventing assessment of whether the observed counts remain bounded independently of h once the geometry is resolved.

    Authors: The manuscript presents the numerical results via figures that plot iteration counts against successive mesh refinements for several geometries. While these figures illustrate the bounded behavior once the geometry is resolved, we acknowledge that the absence of tabulated values makes quantitative verification more difficult. In the revision we will insert a table (or tables) listing, for each geometry, the mesh size h, number of degrees of freedom, and the corresponding GMRES iteration counts, thereby allowing direct confirmation that the counts remain bounded for h below the resolution threshold identified in the text. revision: yes

Circularity Check

0 steps flagged

No circularity: field-of-values analysis is independent theoretical justification

full rationale

The paper's central claim rests on a field-of-values analysis establishing that non-symmetric SBM terms act as asymptotically small perturbations of a standard saddle-point operator. This is presented as a mathematical argument rather than a data fit, self-citation chain, or definitional equivalence. Numerical experiments are described separately as confirmation of mesh-independent GMRES convergence on fine meshes. No step in the provided abstract or described derivation reduces by construction to its inputs; the analysis is self-contained against external benchmarks for preconditioner performance.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

Review performed on abstract only; no explicit free parameters, invented entities, or ad-hoc axioms are stated. The perturbation argument implicitly relies on standard finite-element saddle-point theory.

axioms (1)
  • standard math Standard finite-element theory for saddle-point problems (Stokes) applies to the symmetric part of the SBM operator
    Invoked when the paper treats the non-symmetric SBM terms as perturbations of a standard saddle-point operator.

pith-pipeline@v0.9.1-grok · 5690 in / 1384 out tokens · 30748 ms · 2026-07-03T07:33:01.622421+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

122 extracted references · 15 canonical work pages · 1 internal anchor

  1. [1]

    Acta Numerica , year =

    The immersed boundary method , author =. Acta Numerica , year =

  2. [2]

    Main and G

    A. Main and G. Scovazzi , keywords =. The shifted boundary method for embedded domain computations. Part I: Poisson and Stokes problems , journal =. 2018 , issn =. doi:https://doi.org/10.1016/j.jcp.2017.10.026 , url =

    work page doi:10.1016/j.jcp.2017.10.026 2018

  3. [3]

    2018 , publisher =

    Main, A and Scovazzi, G , journal =. 2018 , publisher =

    2018

  4. [4]

    SIAM Journal on Scientific Computing , volume =

    Krzyzanowski, Piotr , title =. SIAM Journal on Scientific Computing , volume =. 2001 , doi =. https://doi.org/10.1137/S1064827599360406 , abstract =

    work page doi:10.1137/s1064827599360406 2001

  5. [5]

    II library, version 9.7 , author =

    Thedeal. II library, version 9.7 , author =. Journal of Numerical Mathematics , year =

  6. [6]

    Atallah and Claudio Canuto and Guglielmo Scovazzi , keywords =

    Nabil M. Atallah and Claudio Canuto and Guglielmo Scovazzi , keywords =. Analysis of the shifted boundary method for the Stokes problem , journal =. 2020 , issn =. doi:https://doi.org/10.1016/j.cma.2019.112609 , url =

    work page doi:10.1016/j.cma.2019.112609 2020

  7. [7]

    arXiv preprint arXiv:2506.12899 , year =

    A Geometric Multigrid Preconditioner for Discontinuous Galerkin Shifted Boundary Method , author =. arXiv preprint arXiv:2506.12899 , year =

    work page arXiv

  8. [8]

    2026 , eprint =

    A Geometric Multigrid Preconditioner for Shifted Boundary Method , author =. 2026 , eprint =

    2026

  9. [9]

    Numerical Linear Algebra with Applications , volume =

    Krzyżanowski, Piotr , title =. Numerical Linear Algebra with Applications , volume =. doi:https://doi.org/10.1002/nla.717 , url =. https://onlinelibrary.wiley.com/doi/pdf/10.1002/nla.717 , abstract =

    work page doi:10.1002/nla.717

  10. [10]

    1999 , publisher =

    Baumann, Carlos Erik and Oden, J Tinsley , journal =. 1999 , publisher =

    1999

  11. [11]

    Numerical Linear Algebra with Applications , volume =

    Mardal, Kent-Andre and Winther, Ragnar , title =. Numerical Linear Algebra with Applications , volume =. doi:https://doi.org/10.1002/nla.716 , url =. https://onlinelibrary.wiley.com/doi/pdf/10.1002/nla.716 , abstract =

    work page doi:10.1002/nla.716

  12. [12]

    Acta Numerica , volume =

    The immersed boundary method , author =. Acta Numerica , volume =. 2002 , doi =

    2002

  13. [13]

    Burman, S

    Burman, Erik and Claus, Susanne and Hansbo, Peter and Larson, Mats G. and Massing, André , title =. International Journal for Numerical Methods in Engineering , volume =. doi:https://doi.org/10.1002/nme.4823 , url =. https://onlinelibrary.wiley.com/doi/pdf/10.1002/nme.4823 , abstract =

    work page doi:10.1002/nme.4823

  14. [14]

    Finite elements and fast iterative solvers: With applications in incompressible fluid dynamics , author =

  15. [15]

    Computer Methods in Applied Mechanics and Engineering , volume =

    Zorrilla, Rub. Computer Methods in Applied Mechanics and Engineering , volume =. 2024 , publisher =

    2024

  16. [16]

    1971 , publisher =

    Nitsche, Joachim A , journal =. 1971 , publisher =

    1971

  17. [17]

    2024 , publisher =

    Yang, Cheng-Hau and Saurabh, Kumar and Scovazzi, Guglielmo and Canuto, Claudio and Krishnamurthy, Adarsh and Ganapathysubramanian, Baskar , journal =. 2024 , publisher =

    2024

  18. [18]

    Atallah and Claudio Canuto and Guglielmo Scovazzi , keywords =

    Nabil M. Atallah and Claudio Canuto and Guglielmo Scovazzi , keywords =. The high-order Shifted Boundary Method and its analysis , journal =. 2022 , issn =. doi:https://doi.org/10.1016/j.cma.2022.114885 , url =

    work page doi:10.1016/j.cma.2022.114885 2022

  19. [19]

    and Canuto, C

    Atallah, N. and Canuto, C. and Scovazzi, G. , journal =

  20. [20]

    2021 , publisher =

    Atallah, Nabil and Canuto, Claudio and Scovazzi, Guglielmo , journal =. 2021 , publisher =

    2021

  21. [21]

    2024 , publisher =

    Atallah, Nabil and Scovazzi, Guglielmo , journal =. 2024 , publisher =

    2024

  22. [22]

    and Atallah, N

    Li, K. and Atallah, N. and Main, A. and Scovazzi, G. , journal =. 2020 , publisher =

    2020

  23. [23]

    2023 , publisher =

    Collins, J Haydel and Lozinski, Alexei and Scovazzi, Guglielmo , journal =. 2023 , publisher =

    2023

  24. [24]

    Journal of Computational Physics , volume =

    Kuzmin, Dmitri and B. Journal of Computational Physics , volume =. 2022 , publisher =

    2022

  25. [25]

    2021 , publisher =

    Xue, Tianju and Sun, WaiChing and Adriaenssens, Sigrid and Wei, Yujie and Liu, Chuanqi , journal =. 2021 , publisher =

    2021

  26. [26]

    and Colom

    Xu, D. and Colom. Journal of Computational Physics , volume =. 2024 , publisher =

    2024

  27. [27]

    A shifted boundary method based on extension operators , journal =

    Antonelli, Nicol. A shifted boundary method based on extension operators , journal =. 2024 , volume =

    2024

  28. [28]

    A Weighted Shifted Boundary Method for the

    Scovazzi, Guglielmo and Xu, Danjie and Colom. A Weighted Shifted Boundary Method for the. SSRN Preprint , year =

  29. [29]

    Simulating incompressible flows over complex geometries using the shifted boundary method with incomplete adaptive octree meshes , journal =

    Cheng-Hau Yang and Guglielmo Scovazzi and Adarsh Krishnamurthy and Baskar Ganapathysubramanian , keywords =. Simulating incompressible flows over complex geometries using the shifted boundary method with incomplete adaptive octree meshes , journal =. 2026 , issn =. doi:https://doi.org/10.1016/j.jcp.2025.114334 , url =

    work page doi:10.1016/j.jcp.2025.114334 2026

  30. [30]

    Computer Methods in Applied Mechanics and Engineering , year =

    Liu, Chuanqi and others , title =. Computer Methods in Applied Mechanics and Engineering , year =

  31. [31]

    and Main, G

    Li, Kangan and Atallah, Nabil M. and Main, G. Alex and Scovazzi, Guglielmo , title =. Journal of Computational Physics , year =

  32. [32]

    Journal of Computational Physics , volume =

    Scovazzi, Guglielmo and others , title =. Journal of Computational Physics , volume =. 2025 , pages =

    2025

  33. [33]

    Proceedings of ISMA 2024 , year =

    Antonelli, Nicol. Proceedings of ISMA 2024 , year =

    2024

  34. [34]

    and others , title =

    Karatzas, Efthymios N. and others , title =. Computer Methods in Applied Mechanics and Engineering , year =

  35. [35]

    and others , title =

    Saurabh, K. and others , title =. AIMS Applied Computing and Science in Engineering , year =

  36. [36]

    and Verhoosel, C

    de Prenter, F. and Verhoosel, C. V. and van Brummelen, E. H. , title =. Computer Methods in Applied Mechanics and Engineering , year =

  37. [37]

    Numerical Linear Algebra with Applications , year =

    Gross, Sven and Reusken, Arnold , title =. Numerical Linear Algebra with Applications , year =

  38. [38]

    and Philip, Bobby , title =

    Zhang, Qinghai and Guy, Robert D. and Philip, Bobby , title =. Numerical Mathematics: Theory, Methods and Applications , year =

  39. [39]

    Ba. A. 2025 , note =

    2025

  40. [41]

    Multigrid p-Robustness at

    Wichrowski, Micha. Multigrid p-Robustness at. 2025 , journal =

    2025

  41. [42]

    arXiv preprint arXiv:2601.13230 , year =

    Towards Matrix-Free Patch Smoothers for the Stokes Problem: Evaluating Local p-Multigrid Solvers , author =. arXiv preprint arXiv:2601.13230 , year =

    work page arXiv

  42. [43]

    arXiv preprint arXiv:2510.17785 , year =

    Local solvers for high-order patch smoothers via p-multigrid , author =. arXiv preprint arXiv:2510.17785 , year =

    work page arXiv

  43. [44]

    Numerische Mathematik , volume=

    Field-of-values analysis of preconditioned iterative methods for nonsymmetric elliptic problems , author=. Numerische Mathematik , volume=. 1997 , publisher=

    1997

  44. [45]

    Numerische Mathematik , volume=

    Block triangular preconditioners for nonsymmetric saddle point problems: field-of-values analysis , author=. Numerische Mathematik , volume=. 1999 , publisher=

    1999

  45. [46]

    SIAM Journal on Scientific Computing , volume=

    Analysis of preconditioners for saddle-point problems , author=. SIAM Journal on Scientific Computing , volume=. 2004 , publisher=

    2004

  46. [47]

    SIAM Journal on Scientific Computing , volume=

    A note on preconditioning for indefinite linear systems , author=. SIAM Journal on Scientific Computing , volume=. 2000 , publisher=

    2000

  47. [48]

    SIAM Journal on Numerical Analysis , volume=

    Variational iterative methods for nonsymmetric systems of linear equations , author=. SIAM Journal on Numerical Analysis , volume=. 1983 , publisher=

    1983

  48. [49]

    Burman, Erik , journal=

  49. [50]

    2022 , publisher=

    Badia, Santiago and Neiva, Eric and Verdugo, Francesc , journal=. 2022 , publisher=

    2022

  50. [51]

    Burman, Erik and Hansbo, Peter , journal=

  51. [52]

    Computer Methods in Applied Mechanics and Engineering , volume=

    G. Computer Methods in Applied Mechanics and Engineering , volume=. 2019 , publisher=

    2019

  52. [53]

    Computer Methods in Applied Mechanics and Engineering , volume=

    Burman, Erik and Hansbo, Peter and Larson, Mats G and Massing, Andr. Computer Methods in Applied Mechanics and Engineering , volume=. 2016 , publisher=

    2016

  53. [54]

    2020 , publisher=

    Larson, Mats G and Zahedi, Sara , journal=. 2020 , publisher=

    2020

  54. [55]

    Bergbauer, Maximilian and Munch, Peter and Wall, Wolfgang A and Kronbichler, Martin , journal=

  55. [56]

    International Journal for Numerical Methods in Engineering , volume=

    Burman, Erik and Claus, Susanne and Hansbo, Peter and Larson, Mats G and Massing, Andr. International Journal for Numerical Methods in Engineering , volume=. 2015 , publisher=

    2015

  56. [57]

    2024 , publisher=

    Frachon, Thomas and Nilsson, Erik and Zahedi, Sara , journal=. 2024 , publisher=

    2024

  57. [58]

    2022 , publisher=

    Burman, Erik and Hansbo, Peter and Larson, Mats G , journal=. 2022 , publisher=

    2022

  58. [59]

    2017 , organization=

    Hansbo, Peter and Larson, Mats G and Larsson, Karl , booktitle=. 2017 , organization=

    2017

  59. [60]

    2019 , publisher=

    Claus, Susanne and Kerfriden, Pierre , journal=. 2019 , publisher=

    2019

  60. [61]

    Burman, Erik and Hansbo, Peter and Larson, Mats G , journal=

  61. [62]

    2016 , publisher=

    Sticko, Simon and Kreiss, Gunilla , journal=. 2016 , publisher=

    2016

  62. [63]

    2020 , publisher=

    Schoeder, Svenja and Sticko, Simon and Kreiss, Gunilla and Kronbichler, Martin , journal=. 2020 , publisher=

    2020

  63. [64]

    2017 , organization=

    Olshanskii, Maxim A and Reusken, Arnold , booktitle=. 2017 , organization=

    2017

  64. [65]

    2018 , publisher=

    Lehrenfeld, Christoph and Olshanskii, Maxim A and Xu, Xianmin , journal=. 2018 , publisher=

    2018

  65. [66]

    2024 , publisher=

    Heister, Timo and Olshanskii, Maxim A and Yushutin, Vladimir , journal=. 2024 , publisher=

    2024

  66. [67]

    2021 , publisher=

    Jankuhn, Thomas and Reusken, Arnold , journal=. 2021 , publisher=

    2021

  67. [68]

    and Scovazzi, G

    Main, A. and Scovazzi, G. , journal=. 2018 , publisher=

    2018

  68. [69]

    and Scovazzi, G

    Atallah, Nabil and Canuto, C. and Scovazzi, G. , journal=. 2020 , publisher=

    2020

  69. [70]

    International Journal for Numerical Methods in Engineering , volume=

    Li, Kangan and Atallah, Nabil and Rodr. International Journal for Numerical Methods in Engineering , volume=. 2021 , publisher=

    2021

  70. [71]

    2019 , publisher=

    Kronbichler, Martin and Ljungkvist, Karl , journal=. 2019 , publisher=

    2019

  71. [72]

    2019 , publisher=

    Kronbichler, Martin and Kormann, Katharina , journal=. 2019 , publisher=

    2019

  72. [73]

    The International Journal of High Performance Computing Applications , volume=

    Fischer, P and Min, M and Rathnayake, T and Dutta, S and Kolev, T and Dobrev, V and Camier, JS and Kronbichler, M and Warburton, T and. The International Journal of High Performance Computing Applications , volume=

  73. [74]

    2023 , publisher=

    Kronbichler, Martin and Sashko, Dmytro and Munch, Peter , journal=. 2023 , publisher=

    2023

  74. [75]

    2021 , publisher=

    Kolev, Tzanio and Fischer, Paul and Min, Misun and Dongarra, Jack and Brown, Jed and Dobrev, Veselin and Warburton, Tim and Tomov, Stanimire and Shephard, Mark S and Abdelfattah, Ahmad and others , journal=. 2021 , publisher=

    2021

  75. [76]

    2020 , publisher=

    Davydov, Denis and Kronbichler, Martin , journal=. 2020 , publisher=

    2020

  76. [77]

    2020 , publisher=

    Davydov, Denis and Pelteret, Jean-Paul and Arndt, Daniel and Kronbichler, Martin and Steinmann, Paul , journal=. 2020 , publisher=

    2020

  77. [78]

    2020 , publisher=

    Moxey, David and Amici, Roman and Kirby, Mike , journal=. 2020 , publisher=

    2020

  78. [79]

    2012 , publisher=

    Kronbichler, Martin and Kormann, Katharina , journal=. 2012 , publisher=

    2012

  79. [80]

    2020 , publisher=

    Clevenger, Thomas C and Heister, Timo and Kanschat, Guido and Kronbichler, Martin , journal=. 2020 , publisher=

    2020

  80. [81]

    Journal of Scientific Computing , volume=

    Massing, Andr. Journal of Scientific Computing , volume=. 2014 , publisher=

    2014

Showing first 80 references.