An algorithmic approach to direct spline products: procedures and computational aspects
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2026
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866910215113277440 |
|---|---|
| author | Patrizi, Francesco Sestini, Alessandra |
| author_facet | Patrizi, Francesco Sestini, Alessandra |
| contents | We introduce an efficient algorithmic procedure for implementing the direct formula that represents the product of splines in the B-spline basis. We first demonstrate the relevance of this direct approach through numerical evidence showing that implicit methods, such as collocation, may fail in some instances due to severe ill-conditioning of the associated system matrices, whereas the direct formula remains robust. We then recast the direct formula into an algorithmic framework based on the Oslo Algorithm and subsequently enhance it, through a factorization of the terms to be computed, to dramatically improve computational efficiency. Extensive numerical experiments illustrate the substantial reduction in computational cost achieved by the proposed method. Implementation aspects are also discussed to ensure numerical stability and applicability. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_17432 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | An algorithmic approach to direct spline products: procedures and computational aspects Patrizi, Francesco Sestini, Alessandra Numerical Analysis 65D07, 68Q25 We introduce an efficient algorithmic procedure for implementing the direct formula that represents the product of splines in the B-spline basis. We first demonstrate the relevance of this direct approach through numerical evidence showing that implicit methods, such as collocation, may fail in some instances due to severe ill-conditioning of the associated system matrices, whereas the direct formula remains robust. We then recast the direct formula into an algorithmic framework based on the Oslo Algorithm and subsequently enhance it, through a factorization of the terms to be computed, to dramatically improve computational efficiency. Extensive numerical experiments illustrate the substantial reduction in computational cost achieved by the proposed method. Implementation aspects are also discussed to ensure numerical stability and applicability. |
| title | An algorithmic approach to direct spline products: procedures and computational aspects |
| topic | Numerical Analysis 65D07, 68Q25 |
| url | https://arxiv.org/abs/2601.17432 |