Results 101 to 110 of about 194,210 (329)
Approximation of Signals (Functions) by Trigonometric Polynomials in Lp-Norm
Mittal and Rhoades (1999, 2000) and Mittal et al. (2011) have initiated a study of error estimates En(f) through trigonometric-Fourier approximation (tfa) for the situations in which the summability matrix T does not have monotone rows.
M. L. Mittal, Mradul Veer Singh
doaj +1 more source
Anion‐exchange doping of conjugated polymers is an effective way to achieve high conductivities. Here, we report over 2000 S cm−1 electrical conductivity for doped P(g3BTTT). In addition, we show that P(g3BTTT) sustains exceptionally high doping levels without any drop in the charge mobility.
Basil Hunger +14 more
wiley +1 more source
AI–Guided 4D Printing of Carnivorous Plants–Inspired Microneedles for Accelerated Wound Healing
This work presents an artificial intelligence (AI)‐guided 4D‐printed microneedle platform inspired by carnivorous plants for wound healing. A thermo‐responsive shape memory polymer enables body temperature–triggered self‐coiling for autonomous wound closure.
Hyun Lee +21 more
wiley +1 more source
Uniformly polynomially stable approximations for a class of second order evolution equations [PDF]
Zayd Hajjej
openalex +1 more source
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
Switchable Magnonic Crystals Based on Spin Crossover/CrSBr Heterostructures
Multiscale modeling is employed to investigate the functionality of a light‐controlled, tunable magnonic crystal based on spin‐crossover Fe‐pz molecules integrated with a monolayer of CrSBr. Ab initio simulations confirm that the molecules remain functional on the CrSBr surface, while a semiclassical elastic model demonstrates that light‐induced ...
Andrei Shumilin +4 more
wiley +1 more source
Approximation by q-Bernstein Polynomials in the Case q→1+
Let Bn,q(f;x), q∈(0,∞) be the q-Bernstein polynomials of a function f∈C[0,1]. It has been known that, in general, the sequence Bn,qn(f) with qn→1+ is not an approximating sequence for f∈C[0,1], in contrast to the standard case qn→1-.
Xuezhi Wu
doaj +1 more source
Polynomial approximations to 𝐼₀(𝑥), 𝐼₁(𝑥) and related functions [PDF]
F. D. Burgoyne
openalex +1 more source
Recently, the numbers $Y_{n}(\lambda )$ and the polynomials $Y_{n}(x,\lambda)$ have been introduced by the second author [22]. The purpose of this paper is to construct higher-order of these numbers and polynomials with their generating functions.
Kucukoglu, Irem, Simsek, Yilmaz
core

