Results 41 to 50 of about 181 (148)
The zeros of Faber polynomials generated by an đ-star [PDF]
It is shown that the zeros of the Faber polynomials generated by a regular m m -star are located on the
openaire +4 more sources
Comparative AIâBased Framework for NameâBased Demographic Inference in the Indian Subcontinent
A multiâtask framework of five AI models (SVM, XGBoost, LightGBM, BiLSTM, and XLMâRoBERTa) infers nationality, religion, and gender from personal names across seven Indian subcontinent countries. Characterâlevel TFâIDF with SVM achieves the highest accuracy: 83.23% for nationality, 92.94% for religion, and 92.67% for gender across 7581 names.
Sherin Sultana +5 more
wiley +1 more source
Rate of pole detection using Padé approximants to polynomial expansions
Padé approximations constructed from orthogonal and Faber polynomials on some compact set EE serve as tools to detect poles of an approximated function around the set EE.
Wajasat Methawee, Bosuwan Nattapong
doaj +1 more source
On the local asymptotics of Faber polynomials [PDF]
We study a local asymptotics of the (generalized) Faber polynomials at the boundary of the associated domain, under certain mild smoothness conditions on the weight function and geometric conditions on the boundary. The main result exhibits how this asymptotics depends on the corners at the boundary.
openaire +1 more source
Designing new polymers for applications such as sustainable plastics, biomaterials, and 3D printing has traditionally been slow and expensive, relying heavily on trialâandâerror experiments. This review shows how polymer informaticsâthe integration of large polymer databases, machineâlearning models, and automated robotic synthesisâenables fast ...
Md. Saiful Islam +6 more
wiley +1 more source
An algebraic structure for Faber polynomials
Let \(\Sigma= \big\{f(z): f(z)+ z+\sum^\infty_{n=0} a_n z^{-n},|z|> 1\big\}\). The Faber polynomials \(F_n(t)\) associated to \(f\) are defined by the relation \[ {f'(z)\over f(z)- t}= \sum^\infty_{n=0} F_n(t)z^{-(n+1)}. \] It is known that they appear in various problems concerning univalent functions.
Cheon, Gi-Sang +2 more
openaire +1 more source
Gram Decay and Intrinsic Dimensions of Krylov Subspaces
ABSTRACT Krylov subspace methods solve large sparse linear systems Ax=b$$ Ax=b $$ by building a sequence of polynomial approximations to Aâ1b$$ {A}^{-1}b $$ from successive matrixâvector products. In finite precision, the number of numerically independent directions that can be extracted from this sequence is bounded by the intrinsic information ...
Stephen J. Thomas
wiley +1 more source
Rigidity of balls in the solid mean value property for polyharmonic functions
Abstract We show that balls are the only open bounded domains for which the mean value formula for polyharmonic functions holds. We do so by adapting an argument of Ă. Kuran for harmonic functions. We also, provide a quantitative version of the same result.
Nicola Abatangelo
wiley +1 more source
Faber Polynomial Coefficients of Classes of Meromorphic Bistarlike Functions [PDF]
Applying the Faber polynomial coefficient expansions to certain classes of meromorphic bistarlike functions, we demonstrate the unpredictability of their early coefficients and also obtain general coefficient estimates for such functions subject to a given gap series condition. Our results improve some of the coefficient bounds published earlier.
Jay M. Jahangiri, Samaneh G. Hamidi
openaire +3 more sources
MagPiezo enables wireless activation of endogenous Piezo1 channels without genetic modification using 19Â nm magnetic nanoparticles and lowâintensity magnetic fields. It generates torque forces at the piconewton scale to trigger mechanotransduction in endothelial cells, standing as a novel platform to interrogate and manipulate Piezo1 activity in vitro.
Susel Del SolâFernĂĄndez +7 more
wiley +1 more source

