Results 221 to 230 of about 5,753 (265)

Immersed Boundary Projection Method for Boundaries With Slip Velocities

International Journal for Numerical Methods in Fluids, EarlyView.
A formulation of the immersed boundary method for incompressible flow over arbitrarily‐shaped bodies with surface slip described by the Navier boundary condition is presented. The wall slip velocity and the boundary force are determined implicitly through a projection to satisfy both the boundary condition and the divergence‐free condition of the ...
Takehiro Fujii, Takeshi Omori
wiley   +1 more source

PAC-ZNN for Robust Target Tracking in WSNs Against Complex Polynomial Noise. [PDF]

Sensors (Basel)
Zhan Z, Song Z, Huang S, Xie Q, Xiao X.
europepmc   +1 more source

Pseudo-differential operators and generalized random fields over tori. [PDF]

J Pseudodiffer Oper Appl
Escobar N.
europepmc   +1 more source

High-precision integrated diffractive optical networks enabling regression analysis. [PDF]

Nat Commun
Chen C, Ding H, Yu Y, Zhang X.
europepmc   +1 more source

Area-time efficient pipelined number theoretic transform for CRYSTALS-Kyber. [PDF]

PLoS One
Waris A, Aziz A, Khan BM.
europepmc   +1 more source

Energy solutions of singular SPDEs on Hilbert spaces with applications to domains with boundary conditions. [PDF]

Stoch Partial Differ Equ
Gräfner L, Perkowski N, Popat S.
europepmc   +1 more source

Efficient next-generation reservoir computing: An analog in-memory implementation using memristor crossbar arrays. [PDF]

iScience
Lin Z, Wu X, Chen Z, Zhang J, Deng J, Feng Y.   +5 more
europepmc   +1 more source

On the Polynomial Multiplication in Chebyshev Form

IEEE Transactions on Computers, 2012
We give an efficient multiplication method for polynomials in Chebyshev form. This multiplication method is different from the previous ones. Theoretically, we show that the number of multiplications is at least as good as Karatsuba-based algorithm. Moreover, using the proposed method, we improve the number of additions slightly.
Sedat Akleylek, Ferruh Ozbudak, Murat Cenk   +2 more
exaly   +5 more sources

Some of the next articles are maybe not open access.

Related searches:

On Polynomial and Multiplicative Radicals

Quaestiones Mathematicae, 2003
We show that polynomial and multiplicative radicals in [1] are special cases of radicals defined by means of elements. We scrutinize the way of defining a radical γG by a subset G of polynomials in noncommuting indeterminates. Defining polynomial radicals, Drazin and Roberts [1] required that the set G be closed under composition of polynomials ...
Tumurbat, S., Wiegandt, R.
openaire   +2 more sources

On Polynomial Multiplication in Chebyshev Basis [PDF]

IEEE Transactions on Computers, 2012
In a recent paper Lima, Panario and Wang have provided a new method to multiply polynomials in Chebyshev basis which aims at reducing the total number of multiplication when polynomials have small degree. Their idea is to use Karatsuba's multiplication scheme to improve upon the naive method but without being able to get rid of its quadratic complexity.
Pascal Giorgi
exaly   +4 more sources