Search arXivSearch

arXiv · math/0410488

Recent Results on Near-Best Spline Quasi-Interpolants

Abstract

Roughly speaking, a near-best (abbr. NB) quasi-interpolant (abbr. QI) is an approximation operator of the form $Q_af=\sum_{\alpha\in A} \Lambda_\alpha (f) B_\alpha$ where the $B_\alpha$'s are B-splines and the $\Lambda_\alpha (f)$'s are linear discrete or integral forms acting on the given function $f$. These forms depend on a finite number of coefficients which are the components of vectors $a_\alpha$ for $\alpha\in A$. The index $a$ refers to this sequence of vectors. In order that $Q_a p=p$ for all polynomials $p$ belonging to some subspace included in the space of splines generated by the $B_\alpha$'s, each vector $a_\alpha$ must lie in an affine subspace $V_\alpha$, i.e. satisfy some linear constraints. However there remain some degrees of freedom which are used to minimize $\Vert a_\alpha \Vert_1$ for each $\alpha\in A$. It is easy to prove that $\max \{\Vert a_\alpha \Vert_1 ; \alpha\in A\}$ is an upper bound of $\Vert Q_a \Vert_{\infty}$: thus, instead of minimizing the infinite norm of $Q_a$, which is a difficult problem, we minimize an upper bound of this norm, which is much easier to do. Moreover, the latter problem has always at least one solution, which is associated with a NB QI. In the first part of the paper, we give a survey on NB univariate or bivariate spline QIs defined on uniform or non-uniform partitions and already studied by the author and coworkers. In the second part, we give some new results, mainly on univariate and bivariate integral QIs on {\sl non-uniform} partitions: in that case, NB QIs are more difficult to characterize and the optimal properties strongly depend on the geometry of the partition. Therefore we have restricted our study to QIs having interesting shape properties and/or infinite norms uniformly bounded independently of the partition.

Explore related subjects

Keep this discovery

BibTeXRIS

Paul Sablonniere. 2004-10-22. Recent Results on Near-Best Spline Quasi-Interpolants. https://arxiv.org/abs/math/0410488

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Stress-divergence, Laplacian, and rotational forms of the incompressible Navier--Stokes equations with variable viscosity

In the Navier--Stokes equations, incompressibility allows rewriting the viscous term in various forms leading to distinct numerical properties and flow descriptions. Furthermore, models accounting for non-Newtonian, thermal or turbulent effects often break the constant-viscosity assumption, thereby producing additional consistency terms. In this context, the present work compares the classical symmetric-gradient diffusion term with more recent variable-viscosity generalizations of the Laplacian and rotational forms. We discuss, analyze and test their differences with respect to implementation, efficiency, numerical stability and outflow boundary conditions. With a focus on time-dependent flows, we consider second-order implicit-explicit (IMEX) temporal discretizations aimed at improving efficiency and numerical stability. Through a rigorous stability analysis, we show how selected explicit treatments can bypass algorithmic nonlinearities without inducing CFL conditions. Our numerical results highlight important differences between the three viscous formulations---especially in the presence of outflow boundaries, for which the generalized Laplacian form proves more suitable in diffusion-dominated regimes. %(as widely known for constant viscosity).

math.NA

Full-window branch discovery and loss-selected EnKF continuation for data assimilation

We develop a framework for offline full-window branch discovery, optionally followed by online continuation with an ensemble Kalman filter (EnKF). Three mechanisms drive the branch search: adjoint path-kernel (APK) differentiation balances kernel differentiation and correction-stabilized path perturbation, shifting the optimization from exploration to exploitation; an optimized Gaussian initial law broadens the search over initial-state basins; and loss-weighted mixing across independent runs recombines successful path components. We may then select an interior state using a local loss and continue online with an EnKF. In 40-dimensional Lorenz-96 experiments, the mean offline path RMSE of APK is 4.3 times smaller than that of population weak-$\mathrm{4D\text{-}Var}_x$. The resulting APK-EnKF method has a mean online RMSE 64 times smaller than that of ordinary EnKF.

math.NA

A variational physics-informed graph neural network for heterogeneous solid mechanics

Stress localization in heterogeneous solids is governed by the bimaterial interface, where the displacement field remains $C^0$-continuous, while in-plane stresses jump due to the stiffness mismatch. Coordinate-based physics-informed neural networks (PINNs) represent this jump via a prescribed regularization width or a weighted interface penalty, making their accuracy sensitive to how phase-contrast changes are handled. This work presents a variational, label-free physics-informed graph neural network (PI-GNN) in which the heterogeneity is carried by the discretization rather than by the trial field. The solver operates on a conforming adaptive mesh graph, assigns constitutive behavior per element, and minimizes the discrete total potential energy as a single unweighted objective in which only first derivatives appear. The discrete energy on piecewise-linear elements coincides with the finite element (FE) Ritz functional. Dirichlet conditions are enforced by construction, with no penalty term, no interface weight, and no prescribed transition width. Using one fixed architecture, optimizer, and loss across small-strain elasticity and finite-strain Neo-Hookean hyperelasticity in two and three dimensions, the von Mises error remains below $3.58\%$ across a stiffness-contrast sweep spanning $(E_{\mathrm{inc}}/E_{\mathrm{mat}}\in[10^{-2},10^{2}])$, where a strong-form PINN degrades to $5.58\%$, and its displacement error reaches $7.66\%$ against $0.49\%$ for the PI-GNN. A trained network halves the ($\sigma_{xx}$) error of an energy-based PINN ($5.01\%$ versus $10.94\%$). Training cost exceeds a single FE solve by more than an order of magnitude, so the construction is a variationally consistent, penalty-free interface representation for parametric surrogates and inverse identification rather than a replacement for a one-off FE analysis.

math.NA