Related papers: Real-time, local spline interpolation schemes on b…
For the quadratic Lagrange interpolation function, an algorithm is proposed to provide explicit and verified bound for the interpolation error constant that appears in the interpolation error estimation. The upper bound for the…
Detecting slender, overlapping structures remains a challenge in computational microscopy. While recent coordinate-based approaches improve detection, they often produce less accurate splines than pixel-based methods. We introduce a…
Time delay estimation has long been an active area of research. In this work, we show that compressive sensing with interpolation may be used to achieve good estimation precision while lowering the sampling frequency. We propose an…
In this work, we study the Hermite interpolation on $n$-dimensional non-equally spaced, rectilinear grids over a field $\Bbbk $ of characteristic zero, given the values of the function at each point of the grid and the partial derivatives…
In this paper we propose a fast algorithm for trivariate interpolation, which is based on the partition of unity method for constructing a global interpolant by blending local radial basis function interpolants and using locally supported…
In this paper, we consider the solution of ill-conditioned systems of linear algebraic equations that can be determined imprecisely. To improve the stability of the solution process, we "immerse" the original imprecise linear system in an…
We establish best possible pointwise (up to a constant multiple) estimates for approximation, on a finite interval, by polynomials that satisfy finitely many (Hermite) interpolation conditions, and show that these estimates cannot be…
This work provides a complete characterization of the solutions of a linear interpolation problem for vector polynomials. The interpolation problem consists in finding n scalar polynomials such that an equation involving a linear…
In this paper, we build up a framework for sparse interpolation. We first investigate the theoretical limit of the number of unisolvent points for sparse interpolation under a general setting and try to answer some basic questions of this…
We examine interpolatory model reduction methods that are well-suited for treating large scale port-Hamiltonian differential-algebraic systems in a way that is able to preserve and indeed, take advantage of the underlying structural…
This paper studies path synthesis for nonholonomic mobile robots moving in two-dimensional space. We first address the problem of interpolating paths expressed as sequences of straight line segments, such as those produced by some planning…
For solving linear ill-posed problems regularization methods are required when the right hand side is with some noise. In the present paper regularized solutions are obtained by implicit iteration methods in Hilbert scales. % By exploiting…
Reduced-order modeling is an efficient approach for solving parameterized discrete partial differential equations when the solution is needed at many parameter values. An offline step approximates the solution space and an online step…
This contribution presents a model order reduction framework for real-time efficient solution of trimmed, multi-patch isogeometric Kirchhoff-Love shells. In several scenarios, such as design and shape optimization, multiple simulations need…
Many local integral methods are based on an integral formulation over small and heavilly overlapping stencils with local RBF interpolations. These functions have become an extremely effective tool for interpolation on scattered node sets,…
This paper introduces a fast and numerically stable algorithm for the solution of fourth-order linear boundary value problems on an interval. This type of equation arises in a variety of settings in physics and signal processing. Our method…
This paper describes an approximate method for global optimization of polynomial programming problems with bounded variables. The method uses a reformulation and linearization technique to transform the original polynomial optimization…
We present a deep network interpolation strategy for accelerated parallel MR image reconstruction. In particular, we examine the network interpolation in parameter space between a source model that is formulated in an unrolled scheme with…
We establish efficient approximate counting algorithms for several natural problems in local lemma regimes. In particular, we consider the probability of intersection of events and the dimension of intersection of subspaces. Our approach is…
In this paper we address the problem of constructing $G^2$ planar Pythagorean--hodograph (PH) spline curves, that interpolate points, tangent directions and curvatures, and have prescribed arc-length. The interpolation scheme is completely…