نتایج جستجو برای: chebyshev cardinal function

تعداد نتایج: 1222795  

2011
Xianzhen Huang Yimin Zhang Yajuan Jin Hao Lu

This paper presents an effective method for solving stochastic problems commonly encountered in structural engineering and applied mechanics. Design of experiments is conducted to obtain the response values of interest, where Chebyshev nodes are applied to collect discrete samples. Then Chebyshev polynomials are applied to approximate the univariate functional relationship between each variable...

Journal: :J. Complexity 2014
Yanzhao Cao Ying Jiang Yuesheng Xu

We study the orthogonal polynomial expansion on sparse grids for a function of d variables in a weighted L space. A fast algorithm is developed to compute the orthogonal polynomial expansion by combining the fast cosine transform, a fast transform from the Chebyshev orthogonal polynomial basis to the orthogonal polynomial basis for the weighted L space, and a fast algorithm of computing hierarc...

Journal: :SIAM J. Scientific Computing 1999
David J. Torres Evangelos A. Coutsias

An efficient and accurate algorithm for solving the two-dimensional (2D) incompressible Navier–Stokes equations on a disk with no-slip boundary conditions is described. The vorticitystream function formulation of these equations is used, and spatially the vorticity and stream functions are expressed as Fourier–Chebyshev expansions. The Poisson and Helmholtz equations which arise from the implic...

‎Radial basis functions (RBFs) are a powerful tool for approximating the solution of high-dimensional problems‎. ‎They are often referred to as a meshfree method and can be spectrally accurate‎. ‎In this paper, we analyze a new stable method for evaluating Gaussian radial basis function interpolants based on the eigenfunction expansion‎. ‎We develop our approach in two-dimensional spaces for so...

2016
BENJAMIN HACKL

Consider non-negative lattice paths ending at their maximum height, which will be called admissible paths. We show that the probability for a lattice path to be admissible is related to the Chebyshev polynomials of the first or second kind, depending on whether the lattice path is defined with a reflective barrier or not. Parameters like the number of admissible paths with given length or the e...

Journal: :J. Computational Applied Mathematics 2013
Hongchao Kang Shuhuang Xiang Guo He

This paper is concerned with evaluation of integrals whose integrands are oscillatory and contain singularities at the endpoints of the interval of integration. A typical form is G(9) ■ f * w(x)e*xf(x) dx, where a and b can be finite or infinite, 9 is a parameter which is usually large, fix) is analytic in the range of integration, and the singularities are encompassed in the weight function w(...

Journal: :Discrete Mathematics 2012
Yichao Chen Jonathan L. Gross Toufik Mansour

Star-ladder graphs were introduced by Gross in his development of a quadratic-time algorithm for the genus distribution of a cubic outerplanar graph. This paper derives a formula for the genus distribution of star-ladder graphs, using Mohar’s overlap matrix and Chebyshev polynomials. Newly developed methods have led to a number of recent papers that derive genus distributions and total embeddin...

Journal: :The European respiratory journal 2014
Paul M Hassoun

Inflammare, or to set ablaze, is the Latin origin of the word inflammation, a physical condition that was undoubtedly already familiar to the ancient Egyptians and Greeks. It is, however, the Roman Aulus Celsus who is credited with describing, in the first century AD, the four cardinal signs of inflammation consisting of rubor et tumor cum calore et dolore (redness and swelling with heat and pa...

2000
Rongqing Chen Hua Guo

This article provides an overview of some recent developments in quantum dynamic and spectroscopic calculations using the Chebyshev propagator. It is shown that the Chebyshev operator ( Tk (Ĥ)) can be considered as a discrete cosine type propagator ( cos(kΘ̂)), in which the angle operator ( Θ̂ = arccos Ĥ ) is a single-valued mapping of the scaled Hamiltonian ( Ĥ ) and the order (k) is an effectiv...

Journal: :HighTech and innovation journal 2021

This research aims to determine the maximum or minimum value of a Fuzzy Support Vector Machine (FSVM) Algorithm using optimization function. SVM is considered as an effective method data classification, opposed FSVM, which less on large and complex because its sensitivity outliers noise. One techniques used overcome this inefficiency fuzzy logic with ability select right membership function, si...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید