Results 231 to 240 of about 190,411 (265)
Some of the next articles are maybe not open access.
The Numerical Stability of Observability
1990The problem of recovering the initial data of the system x = Ax, y = cx, x(0) = x 0 from the data (y(t 1), y(t 2),…, y(t n )) is considered. It is shown that in general the problem is numerically ill-conditioned for any choice of sampling times t 1 < t 2 < … < t n . In some cases the lower bound for the condition number is obtained.
Clyde Martin, Ilias Iakovidis
openaire +1 more source
1984
Since desk-calculators have been replaced by personal computers, terminals or at least programmable pocket-calculators, it is not possible to follow the execution of an algorithm by the computer step by step. One only sees the result and to judge the acceptability of this result other expedients are necessary.
openaire +2 more sources
Since desk-calculators have been replaced by personal computers, terminals or at least programmable pocket-calculators, it is not possible to follow the execution of an algorithm by the computer step by step. One only sees the result and to judge the acceptability of this result other expedients are necessary.
openaire +2 more sources
Numerical stability of Grünwald–Letnikov method for time fractional delay differential equations
BIT Numerical Mathematics, 2021Lei Li
exaly
Numerical stability of geometric algorithms
Proceedings of the third annual symposium on Computational geometry - SCG '87, 1987Thomas Ottmann +2 more
openaire +1 more source
Numerical stability and dispersion
2016The finite-difference time-domain (FDTD) algorithm samples the electric and magnetic fields at discrete points both in time and space. The choice of the period of sampling (Δt in time, Δx, Δy, and Δz in space) must comply with certain restrictions to guarantee the stability of the solution.
openaire +1 more source