惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

A
About on SuperTechFans
有赞技术团队
有赞技术团队
人人都是产品经理
人人都是产品经理
月光博客
月光博客
美团技术团队
博客园 - 聂微东
阮一峰的网络日志
阮一峰的网络日志
WordPress大学
WordPress大学
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
博客园_首页
爱范儿
爱范儿
G
Google Developers Blog
aimingoo的专栏
aimingoo的专栏
T
The Blog of Author Tim Ferriss
MongoDB | Blog
MongoDB | Blog
小众软件
小众软件
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
IT之家
IT之家
I
InfoQ
B
Blog
H
Hackread – Cybersecurity News, Data Breaches, AI and More
大猫的无限游戏
大猫的无限游戏
T
Tailwind CSS Blog
F
Fortinet All Blogs

math updates on arXiv.org

Coupling-Robust Accuracy in Multiphysics Physics Informed Neural Networks via Kronecker-Preconditioned Optimization Non-normal spectral signatures of instability in neural network training dynamics Optimization of randomized neural networks for transfer operator approximation Selective Ambulance Dispatch Under Contextual Travel-Time Uncertainty LLAMA LIMA: A Living Meta-Analysis on the Effects of Generative AI on Learning Mathematics Neural Flow Operators can Approximate any Operator: Abstract Frameworks and Universal Approximations LLMs as Noisy Channels: A Shannon Perspective on Model Capacity and Scaling Laws On the Stability of Spherical Hellinger-Kantorovich Flows and Their Implications for Differential Privacy Training-Free Looped Transformers Move on Muon : A Hamiltonian probability gradient flow perspective of Muon optimizer Entrywise Error Bounds for Spectral Ranking with Semi-Random Adversaries Asymmetric Scaling Laws from Sparse Features Is Dimensionality a Barrier for Retrieval Models? RA-DCA: A Randomized Active-Set DCA for Directional Stationarity in Max-Structured DC Programs Commutator-Induced Uncertainty in VAEs Weisfeiler-Leman Is Incomplete on Simple Spectrum Graphs, so Canonicalize Them Sparse In-Network Learning via Shortest-Path Backpropagation and Finite-Rate Gating Instance-Optimal Estimation with Multiple LLM Judges on a Budget Entropy Equivalence Testing Expand More, Shrink Less: Shaping Effective-Rank Dynamics for Dense Scaling in Recommendation Any-Dimensional Invariant Universality Operationalizing Individual Fairness via Gradient Descent and Bradley-Terry Models Anytime Training with Schedule-Free Spectral Optimization Diffusion-based Denoising Beats Vanilla Score Matching in Parameter Estimation: A Theoretical Explanation Resilience Characterization of AI-Native Wireless Receivers via Persistent Homology The General Theory of Localization Methods Group-Algebraic Tensors: Provably-optimal Equivariant Learning and Physical Symmetry Discovery General Lower Bounds for Differentially Private Federated Learning with Arbitrary Public-Transcript Interactions PilotWiMAE: Pilot-Native Representation Learning for Wireless Channels Proximal basin hopping: global optimization with guarantees
Analytic First Derivatives of SIDER Interpolation
[Submitted on 12 Jun 2026] · 2026-06-15 · via math updates on arXiv.org

View PDF HTML (experimental)

Abstract:Spherical interpolation is required in numerical and geometric applications in which the unknowns are constrained to remain on the unit sphere. Spherical Interpolation of orDER $n$ (SIDER-$n$) was introduced as the high-order reconstruction component of spherical essentially non-oscillatory interpolation, where the reconstruction is built entirely from spherical linear interpolation (SLERP) operations and therefore preserves the spherical constraint exactly. This paper develops analytic first-derivative formulas for SIDER curves of arbitrary order. The central observation is that the recursive definition of SIDER can be differentiated by direct chain-rule propagation through its binary tree of SLERP operations. After deriving the total derivative of SLERP with moving endpoints, we obtain compact recursions for the derivative of SIDER-$n$, including simplified formulas at interpolation nodes and practical formulas at middle points between consecutive sampling locations. The latter are relevant when a reconstruction is evaluated halfway between data samples, as occurs in several high-order reconstruction-based numerical algorithms. The base case SIDER2 is treated explicitly, and SIDER3 and SIDER4 are used to illustrate the recursive mechanism. We also prove that the derivative is tangent to the sphere at every reconstructed point, including both sampling points and middle points. The resulting formulas extend the original SIDER/SENO framework by supplying differential information for sphere-valued reconstructions, with potential use in high-order finite-volume, ENO/WENO, SENO-type, and related methods for conservation laws and evolution problems.

Submission history

From: Shingyu Leung [view email]
[v1] Fri, 12 Jun 2026 00:36:30 UTC (1,164 KB)