Search results for "interpolation."
showing 10 items of 253 documents
Discrete multiresolution based on hermite interpolation: computing derivatives
2004
Abstract Harten’s framework for multiresolution representation of data has been extended by Warming and Beam in [SIAM J. Sci. Comp. 22 (2000) 1269] to include Hermite interpolation. It needs the point-values of the derivative, which are usually unavailable, so they have to be approximated. In this work we show that the way in which the derivatives are approximated is crucial for the success of the method, and we present a new way to compute them that makes the scheme adequate for non-smooth data.
Weighted ENO interpolation and applications
2004
Abstract Data-dependent interpolatory techniques such as essentially non-oscillatory (ENO) technique [J. Comput. Phys. 71 (1987) 231] have long been used as a reconstruction process in multiresolution schemes. In this work we analyze the weighted ENO (WENO) technique introduced by Liu et al. in the context of conservation laws [J. Comput. Phys. 115 (1994) 200] and improved by Jiang and Shu [J. Comput. Phys. 126 (1996) 202], and apply it to the compression of images, using multiresolution techniques.
On the reconstruction of discontinuous functions using multiquadric RBF–WENO local interpolation techniques
2020
Abstract We discuss several approaches involving the reconstruction of discontinuous one-dimensional functions using parameter-dependent multiquadric radial basis function (MQ-RBF) local interpolants combined with weighted essentially non-oscillatory (WENO) techniques, both in the computation of the locally optimized shape parameter and in the combination of RBF interpolants. We examine the accuracy of the proposed reconstruction techniques in smooth regions and their ability to avoid Gibbs phenomena close to discontinuities. In this paper, we propose a true MQ-RBF–WENO method that does not revert to the classical polynomial WENO approximation near discontinuities, as opposed to what was pr…
Monotone cubic spline interpolation for functions with a strong gradient
2021
Abstract Spline interpolation has been used in several applications due to its favorable properties regarding smoothness and accuracy of the interpolant. However, when there exists a discontinuity or a steep gradient in the data, some artifacts can appear due to the Gibbs phenomenon. Also, preservation of data monotonicity is a requirement in some applications, and that property is not automatically verified by the interpolator. Hence, some additional techniques have to be incorporated so as to ensure monotonicity. The final interpolator is not actually a spline as C 2 regularity and monotonicity are not ensured at the same time. In this paper, we study sufficient conditions to obtain monot…
Ancora sull´inizio delle Phoenissae di Euripide e dell´ Electra sofoclea
2015
Viene discussa l´ autenticita´ dei primi 2 vv. delle Phoen. di Eur. e del v. 1 della El. di Soph. in relazione alle notizie degli scoli: i vv. in questione sono autentici e il fatto che gli scoliasti ne dubitino si spiega all´ interno della tradizione esegetica.
PAINT : Pareto front interpolation for nonlinear multiobjective optimization
2011
A method called PAINT is introduced for computationally expensive multiobjective optimization problems. The method interpolates between a given set of Pareto optimal outcomes. The interpolation provided by the PAINT method implies a mixed integer linear surrogate problem for the original problem which can be optimized with any interactive method to make decisions concerning the original problem. When the scalarizations of the interactive method used do not introduce nonlinearity to the problem (which is true e.g., for the synchronous NIMBUS method), the scalarizations of the surrogate problem can be optimized with available mixed integer linear solvers. Thus, the use of the interactive meth…
The Partial Inner Product Space Method: A Quick Overview
2010
Many families of function spaces play a central role in analysis, in particular, in signal processing (e.g., wavelet or Gabor analysis). Typical are spaces, Besov spaces, amalgam spaces, or modulation spaces. In all these cases, the parameter indexing the family measures the behavior (regularity, decay properties) of particular functions or operators. It turns out that all these space families are, or contain, scales or lattices of Banach spaces, which are special cases ofpartial inner product spaces(PIP-spaces). In this context, it is often said that such families should be taken as a whole and operators, bases, and frames on them should be defined globally, for the whole family, instead o…
Atom-based non-stochastic and stochastic bilinear indices: Application to QSPR/QSAR studies of organic compounds
2008
The recently introduced bilinear indices are applied to the QSAR/QSPR studies of heteroatomic molecules. These novel atom-based molecular fingerprints are used to predict the boiling point of 28 alkyl-alcohols and partition coefficient, specific rate constant and antibacterial activity of 34 2-furylethylenes derivatives. The obtained models are statistically significant and show rather very good stability in a cross-validation experiment. The comparison with other approaches exposes a good behavior of our method in this QSPR studies. The obtained results suggest that with the present method, it is possible to obtain a good estimation of physical, chemical and physicochemical properties for …
Prediction of tyrosinase inhibition activity using atom-based bilinear indices.
2007
A set of novel atom-based molecular fingerprints is proposed based on a bilinear map similar to that defined in linear algebra. These molecular descriptors (MDs) are proposed as a new means of molecular parametrization easily calculated from 2D molecular information. The nonstochastic and stochastic molecular indices match molecular structure provided by molecular topology by using the kth nonstochastic and stochastic graph-theoretical electronic-density matrices, M(k) and S(k), respectively. Thus, the kth nonstochastic and stochastic bilinear indices are calculated using M(k) and S(k) as matrix operators of bilinear transformations. Chemical information is coded by using different pair com…
Genetic Normalized Convolution
2011
Normalized convolution techniques operate on very few samples of a given digital signal and add missing information, trough spatial interpolation. From a practical viewpoint, they make use of data really available and approximate the assumed values of the missing information. The quality of the final result is generally better than that obtained by traditional filling methods as, for example, bilinear or bicubic interpolations. Usually, the position of the samples is assumed to be random and due to transmission errors of the signal. Vice versa, we want to apply normalized convolution to compress data. In this case, we need to arrange a higher density of samples in proximity of zones which c…