To main content

Bernoulli-root sampling for optimal-order isogeometric least-squares collocation

Abstract

We present a Bernoulli-root least-squares collocation method for isogeometric discretizations of one-dimensional nondivergence-form model problems with a variable leading coefficient. On each knot span, the strong residual is sampled at two symmetric roots of the even Bernoulli polynomial Bm(p), where m(p)=2⌊p/2⌋; consequently, consecutive degree pairs share the same sampling points. Although these sampling points coincide with the so-called spline-qualocation nodes, i.e., the quadrature-modified collocation nodes, the proposed degree-paired selection rule is derived analytically from the cancellation of the leading Bernoulli-Peano defect rather than through numerical optimization. For every fixed spline degree p≥3, whether even or odd, on uniform meshes and under the stated coefficient assumptions for u∈Hp+3(Ω), we prove the optimal estimates ‖u−uh,p‖L2(Ω)=O(hp+1) and ‖u−uh,p‖H1(Ω)=O(hp). The sampled least-squares form is shown to be stable on quasi-uniform meshes, and the corresponding H2 estimate of order O(hp−1) requires only u∈Hp+1(Ω). The nonperiodic lower-norm analysis combines a boundary-compatible dual spline, maximum-norm stability of a weighted sampled projection, and a signed Bernoulli–Peano expansion. Numerical experiments confirm the theoretical convergence rates and illustrate their sensitivity to point placement. A tensor-product point rule is also provided for implementation, although the theoretical analysis remains one-dimensional.
Read the publication

Category

Academic article

Language

English

Author(s)

Affiliation

  • SINTEF Digital / Mathematics and Cybernetics
  • Umeå University
  • Norwegian University of Science and Technology
  • University of Houston Downtown
  • University of Texas at Austin

Date

01.10.2026

Year

2026

Published in

Computer Methods in Applied Mechanics and Engineering

ISSN

0045-7825

Volume

463

Issue

B

View this publication at Norwegian Research Information Repository