Results 91 to 100 of about 192,799 (329)
Explicitly solvable complex Chebyshev approximation problems related to sine polynomials [PDF]
Explicitly solvable real Chebyshev approximation problems on the unit interval are typically characterized by simple error curves. A similar principle is presented for complex approximation problems with error curves induced by sine polynomials.
Freund, Roland
core +1 more source
Advanced Materials Technologies, EarlyView.This study explores how machine learning models, trained on small experimental datasets obtained via Phase Doppler Anemometry (PDA), can accurately predict droplet size (D32) in ultrasonic spray coating (USSC). By capturing the influence of ink complexity (solvent, polymer, nanoparticles), power, and flow rate, the model enables precise droplet control
Pieter Verding +5 more
wiley +1 more source
Exponential Splines and Pseudo-Splines: Generation versus reproduction of exponential polynomials
, 2014 Subdivision schemes are iterative methods for the design of smooth curves and surfaces. Any linear subdivision scheme can be identified by a sequence of Laurent polynomials, also called subdivision symbols, which describe the linear rules determining ...
Conti, Costanza +2 more
core
Polynomial‐time approximation schemes for two‐machine open shop scheduling with nonavailability constraints [PDF]
, 2005 Mikhail A. Kubzin +3 more
openalex +1 more source
Approximation by Polynomials with Restricted Zeros
Journal of Approximation Theory, 1994 The authors have discussed convergence properties of polynomials \(p(z)\) whose zeros lie on the real axis or in the upper half-plane \((\text{Im } z\geq 0)\). A result of \textit{B. Ya. Levin} [Mat. Sb., N. Ser. 66(108), 384-397 (1965; Zbl 0145.303)] shows that uniform convergence of such polynomials to a non-zero limit on a complex sequence ...
Clunie, J.G., Kuijlaars, A.B.J.
openaire +4 more sources
Advanced Photonics Research, EarlyView.A graphene‐based bowtie plasmonic nanotweezer is designed and optimized using particle swarm optimization and transfer matrix analysis. The structure achieves strong field confinement, delivering trapping forces up to 6 nN W−1 for 10 nm bioparticles with sixfold lower power requirements than conventional designs.
Saba Ebrahimpanah +2 more
wiley +1 more source
Mean Convergence Rate of Derivatives by Lagrange Interpolation on Chebyshev Grids
Discrete Dynamics in Nature and Society, 2011 We consider the rate of mean convergence of derivatives by Lagrange interpolation operators based on the Chebyshev nodes. Some estimates of error of the derivatives approximation in terms of the error of best approximation by polynomials are derived. Our
Wang Xiulian, Ning Jingrui
doaj +1 more source
Diophantine approximation of polynomials over $\mathbb{F}_q[t]$ satisfying a divisibility condition [PDF]
, 2015 Shuntaro Yamagishi
openalex +1 more source
Approximation by weighted polynomials
Journal of Approximation Theory, 2003 The paper is devoted to the study of approximation by weighted polynomials. The author proves that if \(xQ'(x)\) is increasing on \((0,\infty)\) and \(w(x)= \exp(-Q(x))\) is the corresponding weight on \([0,\infty)\), then every continuous function that vanishes outside.
openaire +1 more source