Pith. Sign in

RECORD

Stability of conforming space-time isogeometric methods for the wave equation

Numerical Analysis · Submitted 22 Mar 2024

abstract compiled · 2026-09-23 · no language-model review

The authors' main claim For each spline order, we derive explicit estimates of both the CFL condition required in the unstabilized case and the penalty term that minimises the consistency error in the stabilized case.

how it is stated · asserted 1.00 read the record →

Comment (0) Read on arXiv ↗
Cite ▾
arXiv ID2403.15043 (version 2)
Pith IDO6BRRVRX, Pith's permanent record of this paper and its review
CitationMatteo Ferrari, Sara Fraschini. "Stability of conforming space-time isogeometric methods for the wave equation." arXiv:2403.15043 (2024). https://pith.science/paper/O6BRRVRX
Claim paper

The compiled record

The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Open the compiled record

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-09-23: 1 request, 6,213 input tokens.

What the abstract itself states, as probabilities: claims first 0.11 · states limitation 0.22 · human participants 0.01 · controlled comparison 0.12 · randomized assignment 0.01 · states quantitative result 0.41 · compares with prior results 0.91 · mentions code or data availability 0.02.

The abstract, sentence by sentence

arXiv listing abstract v2. Results and the main claim are underlined; .

We consider a family of conforming space-time finite element discretizations for the wave equation based on splines of maximal regularity in time. Traditional techniques may require a CFL condition to guarantee stability. Recent works by O. Steinbach and M. Zank (2018), and S. Fraschini, G. Loli, A. Moiola, and G. Sangalli (2023), have introduced unconditionally stable schemes by adding non-consistent penalty terms to the underlying bilinear form. Stability and error analysis have been carried out for lowest order discrete spaces. While higher order methods have shown promising properties through numerical testing, their rigorous analysis was still missing. In this paper, we address this stability analysis by studying the properties of the condition number of a family of matrices associated with the time discretization. For each spline order, we derive explicit estimates of both the CFL condition required in the unstabilized case and the penalty term that minimises the consistency error in the stabilized case. Numerical tests confirm the sharpness of our results.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
s0 We consider a family of conforming space-time finite element discretizations for the wave equation based on splines of maximal regularity in time. contribution 0.34 0.46 0.04 asserted 0.92
s1 Traditional techniques may require a CFL condition to guarantee stability. Recent works by O. Steinbach and M. Zank (2018), and S. Fraschini, G. Loli, A. Moiola, and G. background 1.00 0.04 0.03 hedged possibility 0.94
s2 Sangalli (2023), have introduced unconditionally stable schemes by adding non-consistent penalty terms to the underlying bilinear form. background 1.00 0.04 0.06 asserted 1.00
s3 Stability and error analysis have been carried out for lowest order discrete spaces. background 0.88 0.22 0.04 asserted 1.00
s4 While higher order methods have shown promising properties through numerical testing, their rigorous analysis was still missing. gap 1.00 0.10 0.03 asserted 0.96
s5 In this paper, we address this stability analysis by studying the properties of the condition number of a family of matrices associated with the time discretization. contribution 0.89 0.80 0.12 asserted 0.98
s6 For each spline order, we derive explicit estimates of both the CFL condition required in the unstabilized case and the penalty term that minimises the consistency error in the stabilized case. contribution 0.48 0.96 0.28 asserted 1.00
s7 Numerical tests confirm the sharpness of our results. result 0.95 0.91 0.19 asserted 1.00

What kind of paper the classifier reports this is: theoretical result 1.00 · evidence from proof or derivation 0.99.

What was examined, and what was not

sources read
  • arXiv listing abstract v2
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

The paper
Original abstract

We consider a family of conforming space-time finite element discretizations for the wave equation based on splines of maximal regularity in time. Traditional techniques may require a CFL condition to guarantee stability. Recent works by O. Steinbach and M. Zank (2018), and S. Fraschini, G. Loli, A. Moiola, and G. Sangalli (2023), have introduced unconditionally stable schemes by adding non-consistent penalty terms to the underlying bilinear form. Stability and error analysis have been carried out for lowest order discrete spaces. While higher order methods have shown promising properties through numerical testing, their rigorous analysis was still missing. In this paper, we address this stability analysis by studying the properties of the condition number of a family of matrices associated with the time discretization. For each spline order, we derive explicit estimates of both the CFL condition required in the unstabilized case and the penalty term that minimises the consistency error in the stabilized case. Numerical tests confirm the sharpness of our results.

Human review
How the literature uses it

What this paper does with the arXiv papers it cites

Each citing sentence is taken from the citing paper's LaTeX source and typed by Pith's classifier. A label appears at probability 0.8 or more (0.95 for support), a contest at 0.7 or more; the quoted words are the citing authors'. How each label was checked · JSON

What it cites · 4 sentences without a confident label

Builds on 1 paper
Cites as background 1 paper
  • Among these, we mention the recent works [ref] .

    2312.07268 · Introduction · 0.93

Discussion

Know something about this paper? Leave a comment, or highlight any passage above to comment on it.