Results 211 to 220 of about 190,411 (265)

A numerical framework for fractional and fractal-fractional analysis of the Pehlivan chaotic system using Caputo derivative. [PDF]

Sci Rep
Vinoth R, Jayalakshmi M.
europepmc   +1 more source

Crashworthiness of a Modular Assembled Multi-Cell CFRP Structure: Experimental and Numerical Investigation. [PDF]

Materials (Basel)
Chen T, Kang H, Zhang H, Zhi P, Wang W, Wang Z.   +5 more
europepmc   +1 more source

Discretization and numerical stability

, 1987
openaire   +1 more source

On condition and numerical stability

, 1979
openaire   +1 more source

Computational Complexity and Numerical Stability

SIAM Journal on Computing, 1974
Limiting consideration to algorithms satisfying various numerical stability requirements may change lower bounds for computational complexity and/or make lower bounds easier to prove. We will show that under a sufficiently strong restriction upon numerical stability, any algorithm for multiplying two $n \times n$ matrices using only $+,\, - $ and ...
openaire   +2 more sources

Numerical stability and stabilization of Groebner basis computation

Proceedings of the 2002 international symposium on Symbolic and algebraic computation, 2002
In this paper we consider the problem of the use of approximate arithmetics in Grobner basis computation. This is useful to reduce the cost of integer arithmetic, but is especially necessary for overdetermined systems whose coefficients are only approximately known.We report on some numerical experiments, that show that the intrinsic instability of the
TRAVERSO, CARLO, ZANONI ALBERTO
openaire   +2 more sources

A Stability Criterion for Numerical Integration

Journal of the ACM, 1959
A necessary and sufficient condition is given for the absolute stability of multipoint numerical integration formulas for differential equations. The condition is that a certain matrix of low order, whose elements are computable from the coefficients of the integration formula, be positive definite. Two simple examples are given.
openaire   +2 more sources

Analysis of the numerical stability of algorithms

ICASSP '82. IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005
The aim of this paper is to show the importance of the numerical behavior of formulations in the field of the concrete complexity of algorithms. Up to now many studies have been published to propose an implementation of a given algorithm requiring the least number of computations. This code sometimes provides results which are less accurate than a code
J. Vignes, P. Bois
openaire   +1 more source

Numerical Stability Analysis of FDLBM

Journal of Statistical Physics, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Seta, Takeshi, Takahashi, Ryoichi
openaire   +1 more source