Find link

language:

Find link is a tool written by Edward Betts.

searching for Stable algorithm 18 found (21 total)

Introsort (1,227 words) [view diff] exact match in snippet view article find links to article

performance requirements to be tightened. Introsort is in-place and a non-stable algorithm. If a heapsort implementation and partitioning functions of the type

De Boor's algorithm (1,492 words) [view diff] exact match in snippet view article find links to article

analysis, de Boor's algorithm is a polynomial-time and numerically stable algorithm for evaluating spline curves in B-spline form. It is a generalization

Condition number (2,457 words) [view diff] exact match in snippet view article find links to article

have a property called backward stability; in general, a backward stable algorithm can be expected to accurately solve well-conditioned problems. Numerical

Numerical stability (1,553 words) [view diff] exact match in snippet view article find links to article

that both Δx is small and f (x + Δx) − y* is small. Hence, a backward stable algorithm is always stable. An algorithm is forward stable if its forward error

Arrowhead matrix (1,329 words) [view diff] exact match in snippet view article find links to article

eigenvectors which are not numerically sufficiently orthogonal. The forward stable algorithm which computes each eigenvalue and each component of the corresponding

Carl R. de Boor (1,065 words) [view diff] exact match in snippet view article find links to article

develop. In particular, he formulated a relatively fast and numerically stable algorithm for calculating the values of splines (used extensively in computer-aided

Piecewise linear function (1,201 words) [view diff] exact match in snippet view article find links to article

there is no unique reference model underlying the observed data. A stable algorithm with this case has been derived. If partitions are not known, the residual

DISORT (169 words) [view diff] exact match in snippet view article find links to article

model K. Stamnes, SC. Tsay, W. Wiscombe and K. Jayaweera, Numerically stable algorithm for discrete-ordinate-method radiative transfer in multiple scattering

Well-posed problem (1,540 words) [view diff] exact match in snippet view article find links to article

well-posed, then it stands a good chance of solution on a computer using a stable algorithm. If it is not well-posed, it needs to be re-formulated for numerical

Streamer (software) (176 words) [view diff] exact match in snippet view article

Stamnes, K., S. Tsay, W. Wiscombe and K. Jayaweera, 1988: Numerically stable algorithm for discrete-ordinate-method radiative transfer in multiple scattering

Radix sort (2,604 words) [view diff] exact match in snippet view article find links to article

above, are stable algorithms. MSD radix sort can be implemented as a stable algorithm, but requires the use of a memory buffer of the same size as the input

Numerical analysis (3,919 words) [view diff] exact match in snippet view article find links to article

or numerically unstable. An art of numerical analysis is to find a stable algorithm for solving a well-posed mathematical problem. The field of numerical

Alain Gringarten (538 words) [view diff] exact match in snippet view article find links to article

well-interpretation tool. He is one of the main contributors in establishing a stable algorithm of deconvolution as a least squares mathematical problem. Gringarten

Round-off error (3,788 words) [view diff] exact match in snippet view article find links to article

\textstyle {f(x)={\frac {x}{{\sqrt {1+x}}+1}}}} is stable. Even if a stable algorithm is used, the solution to a problem may still be inaccurate due to the

Hermite interpolation (2,830 words) [view diff] exact match in snippet view article find links to article

the fully general case is given in. A slower but more numerically stable algorithm is described in. Consider the function f ( x ) = x 8 + 1 {\displaystyle

Atmospheric radiative transfer codes (2,602 words) [view diff] exact match in snippet view article find links to article

Knut; Tsay, S. C.; Wiscombe, W.; Jayaweera, Kolf (1988). "Numerically stable algorithm for discrete-ordinate-method radiative transfer in multiple scattering

Exploratory causal analysis (1,688 words) [view diff] exact match in snippet view article find links to article

causal mechanisms of the system, e.g., in geophysics using the PC-stable algorithm (a variant of the original PC algorithm) and in dynamical systems using

Splitting circle method (2,184 words) [view diff] exact match in snippet view article find links to article

1137/S0036144595288554. Malajovich, Gregorio; Zubelli, Jorge P. (1997). "A fast and stable algorithm for splitting polynomials". Computers & Mathematics with Applications