Results 81 to 90 of about 27,120 (203)
An approximate solution of the Blasius problem using spectral method
This paper aims at finding the numerical approximation of a classical Blasius flat plate problem using spectral collocation method. This technique is based on Chebyshev pseudospectral approach that involves the solution is approximated using Chebyshev ...
Zunera Shoukat +6 more
doaj +1 more source
Some results on complex $(p,q)- $extnsion Chebyshev wavelets [PDF]
In this paper, we propose a generalized formula for well-known functions such as $(p,q)$-Chebyshev polynomials. Our consideration is focused on determining properties of generalized Chebyshev polynomials of the first and second kind, sparking interest ...
H. Mazaheri, A.W. Safi, S.M. Jesmani
doaj +1 more source
A note on some extremal problems for trigonometric polynomials [PDF]
n.a.
Dette, Holger, Melas, Viatcheslav B.
core
Mock-Chebyshev Polinom İnterpolasyonu
Polinom interpolasyonunda noktaların geometrik yeri önemli bir rol oynar. Bunu göstermek için, iyi bilinen Runge fenomenini örnek vermek yeterli olacaktır.
IBRAHIMOGLU, Bayram Ali
core +1 more source
Fast Nodal Hessian Computation for Peridynamic Fracture Simulation
A fast, exact nodal Hessian computation for Non‐Ordinary State‐Based Peridynamics is introduced through analytical simplification and a warp‐centric GPU strategy. The method accelerates preconditioned solvers and Vertex Block Descent, enabling interactive fracture simulation with physical accuracy.
Yuxiong Qin +2 more
wiley +1 more source
Chebyshev Approximations by Least Squares Method
We consider the problem of linear approximation in the form of the minimization problem of the weighted Chebyshev norm, and that in the form of the minimization problem of the weighted Euclidean norm of the residual vector.
V.I. Zorkaltsev, E. V. Gubiy
doaj +1 more source
Progressive Convex Hull Simplification
Abstract Convex hulls are useful as tight bounding proxies for a variety of tasks including collision detection, ray intersection, and distance computation. Unfortunately, the complexity of polyhedral convex hulls grows linearly with their input. We consider the problem of conservatively simplifying a convex hull to a specified number of half‐spaces ...
Alec Jacobson
wiley +1 more source
A possibility of increasing the linearity of phasefrequency characteristics in the broadband matching and filtering using a modification of the classical approximation functions is described.
P. V. Boikachov
doaj
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
Chebyshev gradient polynomials for high resolution surface and wavefront reconstruction
A new data processing method based on orthonormal rectangular gradient polynomials is introduced in this work. This methodology is capable of effectively reconstructing surfaces or wavefronts with data obtained from deflectometry systems, especially ...
Oh, Chang Jin +5 more
core +1 more source

