Pith. sign in

REVIEW 3 major objections 3 minor 41 references

Adaptive Morley FEM for the von K\'{a}rm\'{a}n equations with optimal convergence rates

T0 review · 3 major / 3 minor · reviewed 2026-08-14 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read This paper proves that the adaptive Morley finite element method, run after a short uniform-refinement phase, achieves optimal convergence rates for regular solutions of the von Kármán plate equations in the plane.

desk verdict Solid, careful axioms-of-adaptivity paper for Morley FEM on the von Kármán equations; the optimal-rate result is real but sits behind unquantified smallness thresholds and an exact-solve assumption that the authors themselves flag. read the letter →

arxiv 1908.08013 v2 pith:CR3S2UZU submitted 2019-08-21 math.NA cs.NA

Carsten Carstensen , Neela Nataraj This is my paper · ORCID
classification math.NAcs.NA MSC 65N3065N1265N50
keywords vonKármánequationsadaptivefiniteelementmethodMorleynonconformingoptimalconvergenceratesaposteriorierrorestimateaxiomsofadaptivitydiscretereliability
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

The paper proves that the adaptive Morley finite element method, a nonconforming scheme built from quadratic polynomials, approximates a regular solution of the von Kármán plate equations at optimal adaptive convergence rates. The algorithm first refines uniformly until the mesh is fine enough that the nonlinear discrete problem has a unique solution near the exact solution, then runs the standard solve-estimate-mark-refine loop with bulk marking. The advertised result is Theorem 4.3: for every rate $s>0$, the estimator $\eta_\ell$ on the adaptively generated meshes decays as fast as the best possible estimator over all admissible refinements with the same number of triangles, up to constants independent of the smallness parameters. The paper thereby provides the first rate-optimal adaptive scheme for the von Kármán equations, and it removes the barrier that reduced elliptic regularity on nonconvex domains imposes on uniform meshes.

What carries the argument

The mechanism that carries the argument is the abstract axioms-of-adaptivity framework, instantiated for the nonconforming Morley method. The central object is the Morley finite element space $M(T)$: piecewise quadratic functions continuous at triangle vertices and with continuous normal derivatives at edge midpoints, vanishing at boundary degrees of freedom. The key technical tools are a companion operator that maps Morley functions to conforming $H^2_0$ functions and controls the nonconformity gap; a discrete inf-sup condition at the regular solution, inherited from the continuous problem for sufficiently fine meshes; a new piecewise $H^1$ a priori error estimate for $\Psi-\Psi_M$; and a reduction property for the volume part of the residual estimator, which is not a higher-order term in this semilinear problem. The four axioms --- (A1) stability, (A2) reduction, (A3) discrete reliability, and (A4) quasiorthogonality --- are then verified for the explicit residual-based estimator $\eta$, and the abstract theorem converts those axioms into the optimal-rate equivalence.

What would settle it

The theorem would be falsified by exhibiting a regular solution $\Psi$ and arbitrarily fine admissible triangulations $T$ on which the discrete problem (2.6) has two distinct solutions within the piecewise energy ball $|||\Psi-\cdot|||_{\mathrm{pw}}\le \varepsilon_0$, since Theorem 3.1(a) asserts uniqueness for all $T\in\mathcal T(\delta_0)$.

Watch

Extended reading notes

Core claim

The central claim, Theorem 4.3, states that a regular solution $\Psi$ of the von Kármán equations can be approximated by the adaptive Morley FEM with optimal convergence rates. More precisely, given an initial triangulation $T_{\mathrm{init}}$, there exist positive thresholds $\bar\delta$ and $\bar\theta$ such that, whenever the pre-asymptotic uniform refinement reaches a triangulation $T_0$ with maximal mesh-size $\le\bar\delta$ and the bulk parameter $\theta$ satisfies $0<\theta\le\bar\theta$, the output satisfies $$\sup_{\ell\in\mathbb N_0}(1+|T_\ell|-|T_0|)^s\,\eta_\ell \approx \sup_{n\in\mathbb N_0}(1+n)^s \min_{T\in\mathcal T(T_0,n)}\eta(T)$$ for every $s>0$, with equivalence constants that depend on $\Psi$, $T_{\mathrm{init}}$, $\bar\delta$, $\bar\theta$, and $s$ but not on the particular choice of $\delta,\theta$ below the thresholds. The paper establishes this by verifying the four axioms of adaptivity --- stability, reduction, discrete reliability, and quasiorthogonality --- for an explicit residual-based error estimator on the nonconforming Morley spaces.

Load-bearing premise

The proof requires that a preliminary uniform-refinement phase reaches a mesh whose largest element is smaller than an unquantified threshold, and that on every such mesh the nonlinear discrete equations have a unique solution near the exact solution; the paper also assumes these discrete equations are solved exactly.

Editorial extensions

If this is right

  • On nonconvex polygonal domains, where uniform refinement is limited by the elliptic regularity index $\gamma<1$, the adaptive Morley FEM recovers near-best convergence rates in the estimator.
  • The equivalence (4.4) holds for every positive $s$, so the adaptive algorithm is not limited to a fixed algebraic rate; it adapts to the best possible approximation class.
  • The efficiency part of the a posteriori estimate (Theorem 4.1) converts the estimator-rate equivalence into rate optimality for the total error $|||\Psi-\Psi_M|||_{\mathrm{pw}} + \mathrm{osc}_0(f,T)$ with respect to nonlinear approximation classes.
  • Choices of $\delta$ and $\theta$ below the thresholds do not change the asymptotic rate, although smaller $\delta$ lengthens the pre-asymptotic uniform-refinement phase.
  • The results assume exact solves of the discrete nonlinear problem; an inexact solver would need additional perturbation analysis to preserve the rates.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • If the theorem's threshold $\bar\delta$ is extremely small in practice, as the paper suspects may happen near bifurcation points, the pre-asymptotic uniform-refinement phase could dominate the computation; a practical route would be to use continuation or a good initial guess from a coarser level to enter the uniqueness regime earlier.
  • The piecewise $H^1$ a priori estimate and the volume-residual reduction may extend to other nonconforming or discontinuous Galerkin discretizations of fourth-order semilinear problems, since the arguments are formulated without relying on a Rayleigh-Ritz structure.
  • A natural testable consequence is that on convex domains, where the solution is smoother, the adaptive loop should never need to refine far from singularities; one could run AMFEM on a square and check that the marked set stays confined to regions where the estimator is large.
  • The optimal-rate equivalence for all $s>0$ suggests the algorithm is robust with respect to the marking parameter, but the dependence of the equivalence constants on $\bar\theta$ and $\bar\delta$ is not quantified; computing those constants for a model problem would tell how small the parameters must be in practice.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 3 minor

Summary. The paper analyzes an adaptive Morley finite element method for the von Kármán equations. It defines a discrete nonlinear problem, a residual-based error estimator, and an adaptive loop AMFEM with an initial uniform refinement phase. The main theorem (Theorem 4.3) asserts that, for any fixed regular solution and for sufficiently small mesh-size parameter δ and Dörfler parameter θ, the adaptive algorithm produces estimator sequences satisfying the optimal-rate equivalence (4.4). The proof verifies the axioms of adaptivity (A1)-(A4), introducing a new piecewise H1 a priori error estimate, a reduction argument for volume residuals, discrete reliability via a conforming companion, and quasiorthogonality via a perturbed variant (A4)_ε. The paper explicitly acknowledges that exact solves are assumed and that the smallness thresholds are existential.

Significance. If the central theorem holds, this is the first proof of rate-optimal adaptive convergence for the von Kármán equations, and it extends the axiomatic adaptivity framework to a nonconforming semilinear fourth-order problem. The paper contributes a genuinely new piecewise H1 a priori error estimate and carefully treats the trilinear nonlinearity. A notable strength is its transparency: Remarks 4.1, 4.2, and 4.5 explicitly identify the exact-solve idealization, the conjecture that the small-δ requirement may not be a technical artefact, and the possibly large pre-asymptotic range. These caveats limit the practical implications but do not, by themselves, undermine the mathematical claim as an existence theorem.

major comments (3)
  1. [Section 3, proof of Theorem 3.1(c)] The proof of the piecewise H1 estimate for general ℓ∈N is not supplied: the final paragraph states 'further details are omitted' after invoking a higher-order companion operator from Remark 2.3, which is in turn deferred to reference [18]. Since Theorem 3.1(c) is stated for every ℓ∈N0 and Lemma 5.7 invokes it for arbitrary ℓ, this omission affects the axiomatic verification. Please either provide the complete argument or restrict the statement and all subsequent uses to the case ℓ=0, which is what the quasiorthogonality proof actually requires.
  2. [Section 5.5, proof of Theorem 5.8] The proof selects δ with δ≤min{δ0,δ1} and satisfying (5.12), but it immediately uses discrete reliability (A3), which by Theorem 5.4 is guaranteed only for triangulations in T(δ3). The maximization should additionally impose δ≤δ3; the statement of Theorem 5.8 already promises δ≤δ3, so this is a small but real gap in the written proof rather than a substantive obstruction.
  3. [Section 5.5, Corollary 5.9 and Theorem 4.3] The proof of Corollary 5.9 is condensed to a black-box invocation of [24, Thm. 4.1] for an unstated contraction property (A12) and [24, Thm. 3.1] to pass from (A4)_ε to (A4), with no statement of the hypotheses or of the dependence of ρ12 and Λ12 on θ. Because this is the final step connecting the perturbed quasiorthogonality to the optimal-rate theorem, the assumptions used from [24] should be restated precisely, or a self-contained argument should be provided for the present setting.
minor comments (3)
  1. [Abstract and Section 1.3] The phrase 'method of choice for a nonconvex domain' is stronger than what the analysis supports: δ̄ and θ̄ are existential, exact solves are assumed, and Remark 4.2 conjectures that the smallness of δ is not a technical artefact. I recommend softening this to describe the result as an existence theorem with optimal rates under unquantified smallness and exact solves.
  2. [Section 5.6, proof of Theorem 4.3] The final paragraph claims that the equivalence constants in (4.4) are independent of δ and θ, while Theorem 4.2 states that they depend on δ, θ, and T0. The argument that a closer inspection of [14,24] removes this dependence is plausible but not shown; please add the relevant details or explicitly state the weaker dependence that is actually proved.
  3. [Section 1.5 and Section 2.2] The notation T(δ) for triangulations with small mesh-size and T(N) for triangulations with a bounded number of triangles is overloaded and can be confusing, especially in Theorem 4.2 and Section 4.3. A brief notational table or a change of notation for the cardinality-bounded family would improve readability.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: Theorem 4.3 is derived from the independently established axioms of adaptivity plus a priori/a posteriori estimates whose stated assumptions do not include the target optimal-rate result.

full rationale

The derivation chain is not circular. Theorem 4.3 is obtained by verifying axioms (A1)-(A4) for the Morley estimator and then invoking the abstract optimality theorem 4.2 from [14,24]; that abstract theorem is a general benchmark result and does not assume the von Kármán conclusion. The a priori estimate Theorem 3.1 and the a posteriori estimate Theorem 4.1 are cited from [21,35]; they are stated with hypotheses that do not include the optimal-rate equivalence, so they serve as external mathematical support rather than as renamed predictions. The discrete inf-sup Theorem 2.7 from [21] is used to control the nonlinearity, but it concerns discrete stability and not the target convergence-rate assertion. The proofs of (A3) in Theorem 5.4 and of the perturbed quasiorthogonality in Theorem 5.8 are explicit algebraic estimates with smallness conditions; the choices (5.11)-(5.12) are satisfiable and no fitted quantity is relabelled as a prediction. The paper itself flags the genuine limitations in Remark 4.1, where exact solves are called 'the main idealisation', and in Remark 4.2, where it is 'conjectured that this is not a technical artefact' that δ must be very small; Remarks 4.5 and the existential thresholds δ0, δ1, δ3, δ4 concern reachability of hypotheses and quantify practical risk, not circularity. No equation in the paper is defined in terms of the equivalence (4.4), and the central claim is not forced by a self-citation chain.

Assumptions & free parameters 2 free parameters · 7 assumptions · 0 invented entities

The central claim carries two user-chosen smallness parameters, δ and θ, and relies on several cited mathematical tools. No new physical or mathematical entities are postulated; the companion operator and interpolation operators are borrowed from earlier work.

free parameters (2)
  • Mesh-size parameter δ = 0 < δ ≤ min{δ0, δ1, δ3, δ4}
    AMFEM begins with uniform refinement until the mesh size is below δ, and quasiorthogonality requires the smallness condition (5.12). The thresholds are existential and not quantified in the paper.
  • Dörfler bulk parameter θ = 0 < θ < θ0 := 1/(1 + Λ1^2 Λ3)
    The marking parameter must be below a threshold depending on unquantified stability and reliability constants Λ1 and Λ3, and the final theorem requires θ ≤ θ̄ with θ̄ not explicit.
assumptions (7)
  • domain assumption The target solution Ψ is regular, i.e. the Fréchet derivative D F(Ψ): V → V* is an isomorphism, equivalently the inf-sup condition (2.3) holds.
    Assumed throughout after Section 2.1; the main theorem only applies to regular solutions.
  • domain assumption For sufficiently small mesh size, the discrete problem (2.6) has a unique solution Ψ_M near Ψ (Theorem 2.7 and Theorem 3.1.a from [21]).
    This is needed to define Ψ_ℓ for every triangulation in AMFEM; the thresholds δ1 and δ0 are existential and not quantified in this paper.
  • ad hoc to paper Each nonlinear discrete problem is solved exactly at every adaptive step.
    AMFEM assumes exact solve; Remark 4.1 identifies this as the main idealization and leaves inexact-solver analysis to future work.
  • standard math Abstract axioms of adaptivity (A1)-(A4) imply optimal convergence rates, as stated in Theorem 4.2 from [14,24].
    Used as a black box to convert the verified axioms into the rate equivalence (4.4).
  • standard math Elliptic regularity H^{2+γ}(Ω) with γ ∈ (1/2,1] for the biharmonic operator on polygonal domains, as in Theorem 2.1 from [5,36].
    Underlies the a priori estimates and the piecewise H1 error analysis.
  • standard math Morley interpolation estimates (Lemma 2.2) and companion operator properties (Lemma 2.3) hold, as established in [10,16,23,28,31].
    These tools are used throughout the proofs of stability, reduction, discrete reliability, and quasiorthogonality.
  • standard math Newest vertex bisection produces shape-regular admissible refinements and supports the counting arguments behind optimal rates, as in [4,32,41].
    Needed for the mesh-closure and cardinality properties invoked in Theorem 4.2.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Adaptive Morley FEM for the von K\'{a}rm\'{a}n equations with optimal convergence rates." pith.science (2026). https://pith.science/paper/CR3S2UZU

@misc{pith2026190808013,
  author       = {Pith},
  title        = {Pith review of: Adaptive Morley FEM for the von K\'arm\'an equations with optimal convergence rates},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/CR3S2UZU}},
  note         = {Machine review of arXiv:1908.08013}
}
abstract

The adaptive nonconforming Morley finite element method (FEM) approximates a regular solution to the von K\'{a}rm\'{a}n equations with optimal convergence rates for sufficiently fine triangulations and small bulk parameter in the D\"orfler marking. This follows from the general axiomatic framework with the key arguments of stability, reduction, discrete reliability, and quasiorthogonality of an explicit residual-based error estimator. Particular attention is on the nonlinearity and the piecewise Sobolev embeddings required in the resulting trilinear form in the weak formulation of the nonconforming discretisation. The discrete reliability follows with a conforming companion for the discrete Morley functions from the medius analysis. The quasiorthogonality also relies on a novel piecewise $H^1$ a~priori error estimate and a careful analysis of the nonlinearity.

Figures

Figures reproduced from arXiv: 1908.08013 by the authors.

Figure 1
Figure 1. Possible refinements of a triangle in one level within the NVB. The dashed lines indicate the refinement edges of the sub-triangles as in [4, 41]. The Fréchet derivative (Ψ) = (•, •) + 2(Ψ, •, •) of the operator at the regular solution Ψ is an isomorphism and this is equivalent to an inf-sup condition 0 < := inf Θ∈V |||Θ|||=1 sup Φ∈V |||Φ|||=1 [PITH_FULL_IMAGE:figures/full_fig_p004_1.png] view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

41 extracted references · 41 canonical work pages

  1. [18]

    , Adaptive nonconforming Crouzeix-Raviart FEM for eigenval ue problems, Math. Comp. 84 (2015), 1061–1087

    work page 2015

  2. [24]

    Carstensen and H

    C. Carstensen and H. Rabus, Axioms of adaptivity with separate marking for data resolut ion, SIAM J. Numer. Anal. 55 (2017), no. 6, 2644–2665

    work page 2017

  3. [1]

    R. A. Adams, Sobolev spaces, Academic Press [A subsidiary of Harcourt Brace Jovanovich , Publish- ers], New Y ork-London, 1975, Pure and Applied Mathematics, Vol. 65

    work page 1975

  4. [2]

    Belenki, L

    L. Belenki, L. Diening, and C. Kreuzer, Optimality of an adaptive finite element method for the p-Laplacian equation, IMA J. Numer, Anal. 32 (2011), no. 2, 484–510

    work page 2011

  5. [3]

    M. S. Berger and P . C. Fife, Von Kármán equations and the buckling of a thin elastic plate . II plate with general edge conditions, Comm. Pure Appl. Math. 21 (1968), 227–241

    work page 1968

  6. [4]

    Binev, W

    P . Binev, W . Dahmen, and R. DeVore,Adaptive finite element methods with convergence rates , Numer. Math. 97 (2004), no. 2, 219–268

    work page 2004

  7. [5]

    Blum and R

    H. Blum and R. Rannacher, On the boundary value problem of the biharmonic operator on d omains with angular corners, Math. Methods Appl. Sci. 2 (1980), no. 4, 556–581

    work page 1980

  8. [6]

    S. C. Brenner, M. Neilan, A. Reiser, and L.- Y . Sung, A/u1D4360 interior penalty method for a von Kármán plate, Numer. Math. (2016), 1–30

    work page 2016

Show all 41 references
  1. [7]

    S. C. Brenner and L. R. Scott, The mathematical theory of finite element methods , 3rd ed., Springer, 2007

    2007

  2. [8]

    S. C. Brenner and L.- Y . Sung,Discrete Sobolev and Poincaré inequalities via Fourier series, East-West J. Numer. Math. 8 (2000), no. 2, 83–92. MR 1773185

    2000

  3. [9]

    S. C. Brenner, L.- Y . Sung, H. Zhang, and Y . Zhang,A Morley finite element method for the displacement obstacle problem of clamped Kirchhoff plates , J. Comput. Appl. Math. 254 (2013), 31–42. REFERENCES 20

    2013

  4. [10]

    Brenner, Convergence of nonconforming multigrid methods without full elliptic regularity, Math

    S.C. Brenner, Convergence of nonconforming multigrid methods without full elliptic regularity, Math. Comp. 68 (1999), no. 225, 25–53

    1999

  5. [11]

    Brenner, M

    S.C. Brenner, M. Neilan, A. Reiser, and Li- Y eng Sung,A/u1D4360 interior penalty method for a von Kármán plate, Numer. Math. 135 (2017), no. 3, 803–832

    2017

  6. [12]

    Brezzi, Finite element approximations of the von Kármán equations , RAIRO Anal

    F. Brezzi, Finite element approximations of the von Kármán equations , RAIRO Anal. Numér. 12 (1978), no. 4, 303–312

    1978

  7. [13]

    Carstensen and S

    C. Carstensen and S. C. Brenner, Finite element methods, Encyclopedia of Computational Mechanics Second Edition (R. d. Borst E. Stein and T. J. R. Hughes, eds.) , John Wiley and Sons, 2017, pp. 1–47

    2017

  8. [14]

    Carstensen, M

    C. Carstensen, M. Feischl, M. Page, and D. Praetorius, Axioms of adaptivity, Comput. Math. Appl. 67 (2014), no. 6, 1195–1253

    2014

  9. [15]

    Carstensen and D

    C. Carstensen and D. Gallistl, Guaranteed lower eigenvalue bounds for the biharmonic equa tion, Numer. Math. 126 (2014), no. 1, 33–51

    2014

  10. [16]

    Carstensen, D

    C. Carstensen, D. Gallistl, and J. Hu, A discrete Helmholtz decomposition with Morley finite eleme nt functions and the optimality of adaptive finite element schemes, Comput. Math. Appl. 68 (2014), no. 12, part B, 2167–2181

    2014

  11. [17]

    Carstensen, D

    C. Carstensen, D. Gallistl, and M. Schedensack, Discrete reliability for Crouzeix-Raviart FEMs, SIAM J. Numer. Anal. 51 (2013), no. 5, 2935–2955

    2013

  12. [19]

    Carstensen and J

    C. Carstensen and J. Gedicke, An adaptive finite element eigenvalue solver of asymptotic quasi-optimal computational complexity, SIAM J. Numer. Anal. 50 (2012), no. 3, 1029–1057

    2012

  13. [20]

    , Guaranteed lower bounds for eigenvalues, Math. Comput. 83 (2014), no. 290, 2605–2629

    2014

  14. [21]

    Carstensen, G

    C. Carstensen, G. Mallik, and N. Nataraj, Nonconforming finite element discretization for semi- linear problems with trilinear nonlinearity , Accepted for publication in IMA J. Numer. Anal., arXiv:1708.07627 (2019)

    2019 arXiv

  15. [22]

    , A priori and a posteriori error control of discontinuous Gal erkin finite element methods for the von Kármán equations , IMA J. Numer. Anal. 39 (2019), 167–200

    2019

  16. [23]

    Carstensen and S

    C. Carstensen and S. Puttkammer, How to prove the discrete reliability for nonconforming finite element methods, Accepted for publication in J. Comput. Math., arXiv:1808. 03535 (2018)

    2018

  17. [25]

    Cascon, C

    J.M. Cascon, C. Kreuzer, R.H. Nochetto, and K.G. Sieber t, Quasi-optimal convergence rate for an adaptive finite element method , SIAM J. Numer. Anal. 46 (2008), no. 5, 2524–2550

    2008

  18. [26]

    P . G. Ciarlet, The finite element method for elliptic problems , North-Holland, Amsterdam, 1978

    1978

  19. [27]

    II, North-Holland, Amsterdam, 1997

    , Mathematical elasticity: Theory of plates , vol. II, North-Holland, Amsterdam, 1997

    1997

  20. [28]

    Gallistl, Morley finite element method for the eigenvalues of the bihar monic operator , IMA J

    D. Gallistl, Morley finite element method for the eigenvalues of the bihar monic operator , IMA J. Numer. Anal. (2014), 1–33

    2014

  21. [29]

    Gantner, A

    G. Gantner, A. Haberl, D. Praetorius, and B. Stiftner, Rate optimal adaptive FEM with inexact solver for nonlinear operators, IMA J. Numer. Anal. 38 (2017), no. 4, 1797–1831

    2017

  22. [30]

    Holst, S

    M. Holst, S. Pollock, and Y . Zhu, Convergence of goal-oriented adaptive finite element metho ds for semilinear problems, Comput. Visual Sci. (2015), 43–63

    2015

  23. [31]

    Hu and Z

    J. Hu and Z. Shi, A new a posteriori error estimate for the Morley element , Numer. Math. 112 (2009), no. 1, 25–40. REFERENCES 21

    2009

  24. [32]

    Karkulik, D

    M. Karkulik, D. Pavlicek, and D. Praetorius, On 2d newest vertex bisection: Optimality of mesh-closure andℎ1-stability of/u1D4592-projection, Constr. Approx. 38 (2013), 213–284

    2013

  25. [33]

    G. H. Knightly, An existence theorem for the von Kármán equations , Arch. Ration. Mech. Anal. 27 (1967), no. 3, 233–242

    1967

  26. [34]

    Mallik and N

    G. Mallik and N. Nataraj, Conforming finite element methods for the von Kármán equatio ns, Adv. Comput. Math. 42 (2016), no. 5, 1031–1054

    2016

  27. [35]

    , A nonconforming finite element approximation for the von Kár mán equations, ESAIM Math. Model. Numer. Anal. 50 (2016), no. 2, 433–454

    2016

  28. [36]

    Mallik, N

    G. Mallik, N. Nataraj, and J.P . Raymond, Error estimates for the numerical approximation of a distributed optimal control problem governed by the von Kár mán equations , ESAIM Math. Model. Numer. Anal. 52 (2018), 1137–1172

    2018

  29. [37]

    Miyoshi, A mixed finite element method for the solution of the von Kármá n equations, Numer

    T. Miyoshi, A mixed finite element method for the solution of the von Kármá n equations, Numer. Math. 26 (1976), no. 3, 255–269

    1976

  30. [38]

    Quarteroni, Hybrid finite element methods for the von Kármán equations , Calcolo 16 (1979), no

    A. Quarteroni, Hybrid finite element methods for the von Kármán equations , Calcolo 16 (1979), no. 3, 271–288

    1979

  31. [39]

    Reinhart, On the numerical analysis of the von Kármán equations: mixed finite element approxi- mation and continuation techniques , Numer

    L. Reinhart, On the numerical analysis of the von Kármán equations: mixed finite element approxi- mation and continuation techniques , Numer. Math. 39 (1982), no. 3, 371–404

    1982

  32. [40]

    Stevenson, Optimality of a standard adaptive finite element method , Foundations of Computational Mathematics 7 (2007), no

    R. Stevenson, Optimality of a standard adaptive finite element method , Foundations of Computational Mathematics 7 (2007), no. 2, 245–269

    2007

  33. [41]

    Stevenson, The completion of locally refined simplicial partitions created by bisection, Math

    R. Stevenson, The completion of locally refined simplicial partitions created by bisection, Math. Comp. 77 (2008), no. 261, 227–241

    2008

Pith tools

Reviewed August 14, 2026 · model on record in the stance chip above.