Related papers: Digital terrain modeling with the Chebyshev polyno…
In this paper we introduce a new technique based on high-dimensional Chebyshev Tensors that we call \emph{Orthogonal Chebyshev Sliding Technique}. We implemented this technique inside the systems of a tier-one bank, and used it to…
We consider discrete linear Chebyshev approximation problems in which the unknown parameters of linear function are fitted by minimizing the maximum absolute deviation of errors. Such problems find application in the solution of…
In terrain mapping, there are so many ways to measure and estimate the terrain measurements like contouring, vertical profiling, hill shading, hypsometric tinting, perspective view, etc. Here in this paper we are using the contouring…
We investigate the problem of numerical differentiation of bivariate functions from weighted Wiener classes using Chebyshev polynomial expansions. We develop and analyze a new version of the truncation method based on Chebyshev polynomials…
In this paper, we borrow from blind noise parameter estimation (BNPE) methodology early developed in the image processing field an original and innovative no-reference approach to estimate Digital Elevation Model (DEM) vertical error…
The Chebyshev expansion offers a numerically efficient and easy-implement algorithm for evaluating dynamic correlation functions using matrix product states (MPS). In this approach, each recursively generated Chebyshev vector is…
In this study linear and nonlinear higher order singularly perturbed problems are examined by a numerical approach, the differential quadrature method. Here, the main idea is using Chebyshev polynomials to acquire the weighting coefficient…
Accurate calculations of the spectral density in a strongly correlated quantum many-body system are of fundamental importance to study its dynamics in the linear response regime. Typical examples are the calculation of inclusive and…
This paper presents for the first time a robust exact line-search method based on a full pseudospectral (PS) numerical scheme employing orthogonal polynomials. The proposed method takes on an adaptive search procedure and combines the…
Spectral polynomial approximation of smooth functions allows real-time manipulation of and computation with them, as in the Chebfun system. Extension of the technique to two-dimensional and three-dimensional functions on hyperrectangles has…
The accuracy of digital elevation models (DEMs) in urban areas is influenced by numerous factors including land cover and terrain irregularities. Moreover, building artifacts in global DEMs cause artificial blocking of surface flow…
A large class of machine learning techniques requires the solution of optimization problems involving spectral functions of parametric matrices, e.g. log-determinant and nuclear norm. Unfortunately, computing the gradient of a spectral…
This paper proposes a Chebyshev polynomial expansion framework for the recovery of a continuous angular power spectrum (APS) from channel covariance. By exploiting the orthogonality of Chebyshev polynomials in a transformed domain, we…
The vertical modes of linearized equations of motion are widely used by the oceanographic community in numerous theoretical and observational contexts. However, the standard approach for solving the generalized eigenvalue problem using…
In a recent paper we have suggested that the finite temperature density matrix can be computed efficiently by a combination of polynomial expansion and iterative inversion techniques. We present here significant improvements over this…
Several methods have been proposed for correcting the elevation bias in digital elevation models (DEMs) for example, linear regression. Nowadays, supervised machine learning enables the modelling of complex relationships between variables,…
A wide range of numerical methods exists for computing polynomial approximations of solutions of ordinary differential equations based on Chebyshev series expansions or Chebyshev interpolation polynomials. We consider the application of…
Polytopal methods provide a flexible framework for the numerical approximation of partial differential equations on general meshes. Their convergence analysis raises specific challenges due to their inherently non-conforming nature and, in…
We construct one and two parameter deformations of the two dimensional Chebyshev polynomials with simple recurrence coefficients, following the algorithm in [3]. Using inverse scattering techniques, we compute the corresponding…
Chebyshev expansion coefficients can be computed efficiently by using the FFT, and for smooth functions the resulting approximation is close to optimal, with computations that are numerically stable. Given sufficiently accurate function…