PaperlayerView exact revision on arXiv

Source-linked AI summary

Projection geometry and relaxed quasi-orthogonality for inf-sup stable Galerkin methods

Tsogtgerel Gantumur

arXiv:2609.16265v1math.NAmath.FA

TL;DR

The paper addresses how to obtain quasi-orthogonality for nested Petrov–Galerkin methods when exact Pythagoras and full-tail estimates are unavailable. It uses compatible projection geometry, dyadic decomposition, and duality to prove sublinear finite-window bounds. Uniform inf-sup stability guarantees these bounds, but a fixed stable hierarchy demonstrates that full quasi-orthogonality can still fail.

  • Problem

    For strongly indefinite and nonsymmetric problems, exact Pythagoras and full-tail general quasi-orthogonality are generally unavailable or technically difficult.

  • Method

    The paper analyzes uniformly bounded compatible Galerkin projection chains directly, using projection angles, dyadic decomposition, duality, and finite-window detail-space splittings.

  • Results

    Uniform inf-sup stability yields sublinear finite-window quasi-orthogonality with exponent and prefactor controlled by the projection bound, while a fixed stable hierarchy can violate full quasi-orthogonality.

  • Takeaways & Limitations

    Uniform inf-sup stability is sufficient for relaxed finite-window quasi-orthogonality, whereas full quasi-orthogonality requires additional hierarchical information in general.

  • Takeaways & Limitations

    The sharp dependence of the universal exponent on the projection bound remains open, and nontrivial harmonic spaces in mixed finite element exterior calculus are not covered directly.

Abstract

from arXiv · show

We give an elementary, coordinate-free proof that uniformly inf-sup stable nested Petrov-Galerkin methods on Hilbert spaces satisfy relaxed general quasi-orthogonality. More precisely, the accumulated squared Galerkin increments over any window of $N$ consecutive levels are bounded by the squared error at the beginning of the window times $N^σ$, where $σ<1$, and both $σ$ and the constant prefactor depend explicitly only on a uniform bound for the Galerkin projections. The proof uses the Hilbert space angle between consecutive blocks of a uniformly bounded compatible projection chain, together with a dyadic decomposition and duality. It avoids matrix representations, wavelet bases, and LU-factorization. For symmetric indefinite problems, we relate the argument to the positive and negative spectral splittings of the Galerkin detail spaces and obtain a valid finite-window version of the sign-decomposition approach. We also construct a fixed self-adjoint involution and a fixed nested, uniformly inf-sup stable Galerkin sequence for which full general quasi-orthogonality fails. The same construction yields, for every $0<α<1$, finite-support targets whose full-tail ratios grow at least like $N^α$. Thus uniform inf-sup stability guarantees sublinear finite-window quasi-orthogonality, whereas full quasi-orthogonality requires additional hierarchical information in general.

1. Introduction

The paper replaces exact Pythagoras and difficult full-tail quasi-orthogonality arguments with a geometric, finite-window result for uniformly stable nested Petrov–Galerkin methods. It proves sublinear growth controlled only by projection bounds, while exhibiting fixed stable hierarchies where full quasi-orthogonality fails.

  • For indefinite, saddle-point, and nonsymmetric problems, exact Pythagoras is generally unavailable, motivating structural substitutes for cumulative Galerkin-increment control.
  • The paper directly analyzes uniformly bounded compatible Galerkin projections, avoiding stiffness matrices, wavelet bases, and LU-factorizations.
  • The projection theorem provides explicit finite-window power-type square-function estimates for detail vectors, using an elementary basis-free argument applicable to higher-dimensional detail spaces.
  • Uniform inf-sup stability with continuity constant C and discrete inf-sup constant γ gives projection bound K ≤ C/γ, making the relaxed exponent and prefactor uniform across targets and nested sequences sharing these constants.
  • For self-adjoint indefinite problems, positive and negative detail splittings yield a finite-window sign operator, replacing the generally unavailable uniformly bounded infinite splitting.
  • A fixed self-adjoint involution and uniformly stable nested Galerkin sequence can violate full quasi-orthogonality, with finite-support targets having full-tail ratios growing at least as N^α.

2. Projection angles and finite-window square functions

The paper derives finite-window square-function estimates from the angle geometry of uniformly bounded compatible projection chains. Duality extends the estimate to two-sided bounds and block multipliers, with a finite block-LU consequence.

  • A compatible projection chain has commuting projections with increasing ranges; its detail projections are Δj = Pj − Pj−1 and detail spaces are Ej = ran Δj.
  • The uniform projection bound K controls the angle between an initial detail block and the consecutive block that follows it.
  • When K = 1, every projection is orthogonal and consecutive detail blocks are orthogonal, so the angle parameter vanishes.
  • Dyadic splitting of consecutive index intervals converts the angle estimate into an upper finite-window square-function estimate for arbitrary vectors yj ∈ Ej.
  • Applying the argument to the adjoint chain and using duality yields a two-sided square-function estimate.
  • The two-sided estimate controls independent detail-space block multipliers and supports the finite-window sign splitting used later.
  • 2.4. A finite block-LU consequence: The square-function result also recovers finite block-LU growth for matrices with uniformly controlled leading principal block sections and explicit exponent determined by C/γ.

3. Relaxed quasi-orthogonality for inf-sup stable Galerkin methods

Nested uniformly inf-sup stable Petrov–Galerkin methods generate compatible Galerkin projection chains with a uniform bound controlled by continuity and discrete stability. The resulting finite-window square-function estimate gives quantitative relaxed quasi-orthogonality uniformly over targets and nested approximation paths.

  • 3.1. Nested Petrov–Galerkin projections.: The Galerkin projections form a compatible projection chain with uniform bound K = C_a/γ under nested spaces and uniform discrete inf-sup stability.Equal dimensions ensure existence and uniqueness, while compatibility follows from nested trial and test spaces and Galerkin uniqueness.
  • 3.2. Quantitative relaxed quasi-orthogonality.: Relaxed GQO requires C_G(N) = o(N), whereas full GQO requires the stronger condition C_G(∞) < ∞.The paper distinguishes finite-window sublinear growth from uniform control over the full infinite tail.
  • 3.2. Quantitative relaxed quasi-orthogonality.: For every starting level and window length N, the squared Galerkin increments are bounded by the initial error times C_qo(K)N^σ_K with σ_K < 1.The estimate applies to u_ℓ = G_ℓu and uses the detail projections and their adjoints in a two-sided square-function argument.
  • 3.2. Quantitative relaxed quasi-orthogonality.: At the orthogonal endpoint K = 1, Galerkin increments are mutually orthogonal and the sharp finite-window GQO constant is at most 1.The general explicit constant is therefore not sharp when the projection chain is orthogonal.
  • 3.2. Quantitative relaxed quasi-orthogonality.: The exponent and prefactor depend explicitly only on the common projection bound, so the guarantee is uniform over targets and adaptive paths with bounded C_a/γ.The constants are monotone in K, and the explicit prefactor is C_qo(K) = 4K^2(1 + ϑ_K).

4. Consequences for adaptive methods

The finite-window estimate supplies the relaxed quasi-orthogonality ingredient required by standard axioms of adaptivity. Under the stated estimator, marking, and refinement assumptions, it yields linear estimator convergence and rate-optimal adaptive methods.

  • 4. Consequences for adaptive methods: Under estimator reduction, reliability, and quasi-monotonicity, the finite-window estimate yields linear estimator convergence with constants depending only on structural bounds.Proposition 4.1 assumes the listed estimator properties and produces C_lin ≥ 1 and 0 < q_lin < 1.
  • 4. Consequences for adaptive methods: With the additional estimator, marking, and refinement hypotheses, adaptive algorithms converge with the optimal algebraic rates permitted by their approximation class.The optimality multiplier depends only on continuity, inf-sup, estimator, marking, and refinement constants, not on the target solution.
  • 4.1. Taylor–Hood discretizations of the Stokes problem.: For Taylor–Hood discretizations of Stokes, uniform discrete inf-sup stability lets the projection theorem provide relaxed quasi-orthogonality for every nested admissible sequence.The required adaptive estimator and refinement properties then recover the rate-optimality conclusion.
  • 4. Consequences for adaptive methods: The relaxed approach avoids wavelet-type Riesz bases, Jaffard-class decay, matrix representations, and LU-factorization.
  • 4. Consequences for adaptive methods: The same projection-geometric argument applies to nonsymmetric Johnson–Nédélec coupling because its nested conforming spaces satisfy a uniform discrete inf-sup condition.This gives an alternative route to rate optimality without hierarchical coordinates or LU-factor estimates.

5. Symmetric indefinite problems and finite-window sign geometry

For self-adjoint indefinite problems, local positive–negative spectral splittings of Galerkin detail spaces can be assembled over finite windows. This recovers relaxed GQO with quantitative control, but uniform inf-sup stability alone does not generally yield full GQO.

  • 5. Symmetric indefinite problems and finite-window sign geometry: Each local detail compression B_j is self-adjoint and invertible, enabling the sign operator R_j = sgn(B_j) as an orthogonal involution.The local spectral splitting separates positive and negative detail modes before finite-window assembly.
  • 5. Symmetric indefinite problems and finite-window sign geometry: The finite-window sign operator J_I combines local sign operators across consecutive detail spaces and satisfies a sublinear norm estimate when the window contains n levels.The construction controls the assembled operator through the projection square-function theorem rather than requiring an infinite decomposition.
  • 5. Symmetric indefinite problems and finite-window sign geometry: The detail spaces need not be mutually orthogonal, so J_I need not be self-adjoint in the ambient Hilbert inner product.Its algebraic directness remains sufficient to define the finite-window operator.
  • 5. Symmetric indefinite problems and finite-window sign geometry: Finite-window sign separation recovers relaxed GQO, provided local spectral signs are assembled only over finite intervals with quantitatively controlled block-sign norms.The unresolved infinite positive–negative complementability issue is avoided by finite-window assembly.
  • 5. Symmetric indefinite problems and finite-window sign geometry: Uniform inf-sup stability alone guarantees only the sublinear finite-window bound, while a stronger full-GQO bound can fail for a fixed self-adjoint involution and fixed stable Galerkin sequence.

6. Full GQO can fail under uniform inf-sup stability

The paper constructs fixed self-adjoint and uniformly stable Galerkin examples where full general quasi-orthogonality fails, including finite-support targets with polynomially growing full-tail ratios.

  • Full GQO fails for a fixed self-adjoint involution and fixed nested uniformly stable Galerkin hierarchy.The construction keeps the operator and hierarchy fixed while varying the target in the finite-support family.
  • 6.1. A weighted trigonometric Schauder basis.: The weighted trigonometric system forms a Schauder basis of Hα, ensuring strong convergence of the associated partial-sum projections.Uniform boundedness of partial sums and convergence on a dense span yield the basis property and Πm → I strongly.
  • The involution J exchanges the two Hilbert-space components and is self-adjoint and unitary, while its action yields the stated alternating orthogonality relations.These relations make the restricted indefinite form nondegenerate on the Galerkin spaces.
  • The Galerkin projections are uniformly stable because the continuous inf-sup constant is 1 and the discrete stability constants remain uniformly positive.The hierarchy is therefore a valid uniformly inf-sup stable Galerkin sequence despite failure of full GQO.
  • The exponent’s dependence on the projection bound is essential: as α approaches 1, Kα diverges and the discrete inf-sup constants can approach zero.Thus nearly linear tail growth does not contradict a uniform sublinear exponent under a common projection bound.

7. Discussion and further questions

Uniform inf-sup stability guarantees sublinear finite-window GQO but not full GQO; stronger hierarchical structure can recover full-tail control, while several extensions remain bounded by additional assumptions.

  • 7.1. Uniform stability versus full GQO.: Uniform inf-sup stability yields sublinear finite-window GQO, whereas full GQO requires additional hierarchical information in general.Similarity to an orthogonal projection chain is given as one stronger sufficient condition for full GQO.
  • 7.1. Uniform stability versus full GQO.: The counterexample cannot be similar to an orthogonal projection chain through any boundedly invertible operator.Such similarity would provide the stronger hierarchical structure excluded by the constructed example.
  • 7.2. Sharp exponents and the LU connection.: The sharp dependence of the universal exponent on the projection bound remains open.The weighted Fourier example supplies lower bounds at its own bound Kα, but explicit lower bounds at a prescribed K require additional quantitative control.
  • 7.2. Sharp exponents and the LU connection.: The projection argument bypasses LU factorization for relaxed GQO, but does not replace locality and decay analysis needed for full GQO.Earlier full-GQO proofs use hierarchical Riesz bases and off-diagonal decay, while relaxed estimates need only sublinear finite-factor growth.
  • 7.3. Further settings.: Mixed finite element exterior calculus is directly covered when product spaces are nested, harmonic spaces are trivial, and discrete inf-sup constants are uniform.Nontrivial harmonic forms introduce moving discrete harmonic spaces and require additional analysis.
  • 7.3. Further settings.: Sublinear cumulative nonorthogonality suffices for the standard adaptive conclusions of linear convergence and rate optimality.Full GQO remains useful for uniform infinite-tail estimates but is not required for these adaptive results.
Loading 2609.16265v1…