Results 31 to 40 of about 13,221 (124)
Asymptotic and Non-asymptotic Results in the Approximation by Bernstein Polynomials
This paper deals with the approximation of functions by the classical Bernstein polynomials in terms of the Ditzian–Totik modulus of smoothness.
J. Adell, D. Cárdenas-Morales
semanticscholar +1 more source
Detecting Relevant Deviations From the White Noise Assumption for Non‐Stationary Time Series
ABSTRACT We consider the problem of detecting deviations from a white noise assumption in time series. Our approach differs from the numerous methods proposed for this purpose with respect to two aspects. First, we allow for non‐stationary time series. Second, we address the problem that a white noise test is usually not performed because one believes ...
Patrick Bastian
wiley +1 more source
Relating Signed Kazhdan-Lusztig Polynomials and Classical Kazhdan-Lusztig Polynomials
Motivated by studying the Unitary Dual Problem, a variation of Kazhdan-Lusztig polynomials was defined in [Yee08] which encodes signature information at each level of the Jantzen filtration.
Yee, Wai Ling
core +1 more source
Empirical‐Process Limit Theory and Filter Approximation Bounds for Score‐Driven Time Series Models
ABSTRACT This article examines the filtering and approximation‐theoretic properties of score‐driven time series models. Under specific Lipschitz‐type and tail conditions, new results are derived, leading to maximal and deviation inequalities for the filtering approximation error using empirical process theory.
Enzo D'Innocenzo
wiley +1 more source
In this paper, a heuristic scheme based on the hybridization of Bernstein Polynomials (BPs) and nature-inspired optimization techniques is presented to achieve the numerical solution of Nonlinear Optimal Control Problems (NOCPs) efficiently. The solution
Ghulam Fareed Laghari +5 more
semanticscholar +1 more source
Efficient Dynamics: Reduced‐Order Modeling of the Time‐Dependent Schrödinger Equation
Reduced‐order modeling (ROM) approaches for the time‐dependent Schrödinger equation are investigated, highlighting their ability to simulate quantum dynamics efficiently. Proper Orthogonal Decomposition, Dynamic Mode Decomposition, and Reduced Basis Methods are compared across canonical systems and extended to higher dimensions.
Kolade M. Owolabi
wiley +1 more source
Convergence properties of dynamic mode decomposition for analytic interval maps
Abstract Extended dynamic mode decomposition (EDMD) is a data‐driven algorithm for approximating spectral data of the Koopman operator associated to a dynamical system, combining a Galerkin method with N$N$ functions and a quadrature method with M$M$ quadrature nodes.
Elliz Akindji +3 more
wiley +1 more source
Bounds on the number of real solutions to polynomial equations [PDF]
We use Gale duality for polynomial complete intersections and adapt the proof of the fewnomial bound for positive solutions to obtain the bound (e^4+3) 2^(k choose 2) n^k/4 for the number of non-zero real solutions to a system of n polynomials in n ...
Bates, Daniel J. +2 more
core +2 more sources
The Kazhdan-Lusztig conjecture for finite W-algebras
We study the representation theory of finite W-algebras. After introducing parabolic subalgebras to describe the structure of W-algebras, we define the Verma modules and give a conjecture for the Kac determinant.
B. L. Feigin +16 more
core +2 more sources
This paper introduces the Fractional Novel Analytical Method (FNAM), a Taylor‐series‐based technique for approximating nonlinear fractional differential‐difference equations. Built on the Caputo derivative, FNAM achieves rapid convergence without relying on Adomian polynomials, perturbation schemes, or transform methods.
Uroosa Arshad +3 more
wiley +1 more source

