相关论文: Adaptive Thiele interpolation
In this paper, we first apply the Fitzpatrick algorithm to osculatory rational interpolation. Then based on Fitzpatrick algorithm, we present a Neville-like algorithm for Cauchy interpolation. With this algorithm, we can determine the value…
Topology optimization is one of the engineering tools for finding efficient design. For the material interpolation scheme, it is usual to employ the SIMP (Solid Isotropic Material with Penalization) or the homogenization based interpolation…
We consider linear inverse problems under white noise. These types of problems can be tackled with, e.g., iterative regularisation methods and the main challenge is to determine a suitable stopping index for the iteration. Convergence…
The fast Ewald methods are widely used to compute the point-charge electrostatic interactions in molecular simulations. The key step that introduces errors in the computation is the particle-mesh interpolation. In this work, the optimal…
Neville's algorithm is known to provide an efficient and numerically stable solution for polynomial interpolations. In this paper, an extension of this algorithm is presented which includes the derivatives of the interpolating polynomial.
The size and complexity of modern astronomical surveys has grown to the point where, in many cases, traditional human scheduling of observations are tedious at best and impractical at worst. Automated scheduling algorithms present an…
The interpolative decomposition (ID) aims to construct a low-rank approximation formed by a basis consisting of row/column skeletons in the original matrix and a corresponding interpolation matrix. This work explores fast and accurate ID…
We consider regular polynomial interpolation algorithms on recursively defined sets of interpolation points which approximate global solutions of arbitrary well-posed systems of linear partial differential equations. Convergence of the…
Polynomial regression is widely used and can help to express nonlinear patterns. However, considering very high polynomial orders may lead to overfitting and poor extrapolation ability for unseen data. The paper presents a method for…
This paper addresses the problem of tightening the mixed-integer linear programming (MILP) formulation for continuous piecewise linear (CPWL) approximations of data sets in arbitrary dimensions. The MILP formulation leverages the…
In the first part of planned series of papers the formal general solutions to selection of 80 examples of different types of second order nonlinear PDEs in two independent variables with constant parameters are given. The main goal here is…
Tensor interpolation is an essential step for tensor data analysis in various fields of application and scientific disciplines. In the present work, novel interpolation schemes for general, i.e., symmetric or non-symmetric, invertible…
We investigate how nonlinear behaviour (both of forcing in time and of the system itself) can affect the skill of early warning signals to predict tipping in (directionally) coupled bistable systems when using measures based on critical…
In a standard NP-complete optimization problem we introduce an interpolating algorithm between the quick decrease along the gradient (greedy dynamics) and a slow decrease close to the level curves (reluctant dynamics). We find that for a…
Multirate behavior of ordinary differential equations (ODEs) and differential-algebraic equations (DAEs) is characterized by widely separated time constants in different components of the solution or different additive terms of the…
We describe an adaptive greedy algorithm for Thiele continued-fraction approximation of a function defined on a continuum domain in the complex plane. The algorithm iteratively selects interpolation nodes from an adaptively refined set of…
Sudden and abrupt changes can occur in a nonlinear system within many fields of science when such a system crosses a tipping point and rapid changes of the system occur in response to slow changes in an external forcing. These can occur…
The last two decades have seen major developments in interpolatory methods for model reduction of large-scale linear dynamical systems. Advances of note include the ability to produce (locally) optimal reduced models at modest cost; refined…
A fast and reliable algorithm for the optimal interpolation of scattered data on the torus by multivariate trigonometric polynomials is presented. The algorithm is based on a variant of the conjugate gradient method in combination with the…
We consider the piecewise linear approximation of saddle functions of the form $f(x,y)=ax^2-by^2$ under the L-infinity error norm. We show that interpolating approximations are not optimal. One can get slightly smaller errors by allowing…