Results 91 to 100 of about 45,618 (222)
Using Chebyshev Polynomials to Approximate Partial Differential Equations [PDF]
This paper suggests a simple method based on a Chebyshev approximation at Chebyshev nodes to approximate partial differential equations. It consists in determining the value function by using a set of nodes and basis functions.
Guglielmo Maria Caporale, Mario Cerrato
core
A Dynamic Correlation‐Information‐Fusion‐Based Spatiotemporal Network for Traffic Flow Forecasting
ABSTRACT Traffic Flow Forecasting (TFF) is a foundational task in the development of Intelligent Transport Systems (ITSs). The primary challenge is to undertake a comprehensive exploration of the intrinsic dynamic spatiotemporal correlations of the road network, unveiling the long‐term evolutionary traffic trends.
Dawen Xia +6 more
wiley +1 more source
Quasi-Interpolation on Chebyshev Grids with Boundary Corrections
Quasi-interpolation is a powerful tool for approximating functions using radial basis functions (RBFs) such as Gaussian kernels. This avoids solving large systems of equations as in RBF interpolation. However, quasi-interpolation with Gaussian kernels on
Faisal Alsharif
doaj +1 more source
On certain functionals of normal processes Technical report no. 1 [PDF]
Probabilistic modeling and stochastic process investigations to provide measures of quality of performance and reliability for systems engineering - Chebyshev ...
Cryer, J. D., Leadbetter, M. R.
core +1 more source
Chebyshev polynomial approximation to approximate partial differential equations [PDF]
This pa per suggests a simple method based on Chebyshev approximation at Chebyshev nodes to approximate partial differential equations. The methodology simply consists in determining the value function by using a set of nodes and basis functions.
Guglielmo Maria Caporale, Mario Cerrato
core
Accelerated filtering on graphs using Lanczos method [PDF]
Signal-processing on graphs has developed into a very active field of research during the last decade. In particular, the number of applications using frames constructed from graphs, like wavelets on graphs, has substantially increased.
Kressner, Daniel +3 more
core +1 more source
Miners' Reward Elasticity and Stability of Competing Proof‐of‐Work Cryptocurrencies
ABSTRACT Proof‐of‐Work cryptocurrencies employ miners to sustain the system through algorithmic reward adjustments. We develop a stochastic model of the multicurrency mining and identify conditions for stable transaction speeds. Bitcoin's algorithm requires hash supply elasticity <$<$1 for stability, while ASERT remains stable for any elasticity and ...
Kohei Kawaguchi +2 more
wiley +1 more source
Unconditional Variance Estimation Under Complex Surveys
Summary The unconditional framework treats the samples and the variables of interest as random variables. This is particularly suitable with analytic inference, when modelling survey data. We show that variance estimation does not involve finite population corrections and joint‐inclusion probabilities, even with large sampling fractions and under ...
Yves G. Berger
wiley +1 more source
Monetary Policy When Preferences Are Quasi‐Hyperbolic
Abstract We study discretionary monetary policy in an economy where economic agents have quasi‐hyperbolic discounting. We demonstrate that a benevolent central bank is able to keep inflation under control for a wide range of discount factors. If the central bank, however, does not adopt the household's time preferences and tries to discourage early ...
RICHARD DENNIS, OLEG KIRSANOV
wiley +1 more source
INTEGRAL POINTS ON THE CHEBYSHEV DYNAMICAL SYSTEMS
Let K be a number field and let S be a finite set of primes of K containing all the infinite ones. Let 0 2 A 1 (K) P 1 (K) and let 0 be the set of the images of 0 under especially all Chebyshev morphisms. Then for any 2 A 1 (K), we show that there are only a finite number of elements in 0 which are S-integral on P1 relative to ( ).
openaire +2 more sources

