Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

An important problem that arises in many scientific and engineering applications is that of approximating limits of infinite sequences which in most instances converge very slowly. Thus, to approximate limits with reasonable accuracy, it is necessary to compute a large number of terms, and this is in general costly. These limits can be approximated economically and with high accuracy by applying suitable extrapolation (or convergence acceleration) methods to a small number of terms. This state-of-the art reference for mathematicians, scientists and engineers is concerned with the coherent treatment, including derivation, analysis, and applications, of the most useful scalar extrapolation methods. The methods discussed are geared toward common problems in scientific and engineering disciplines. It differs from existing books by concentrateing on the most powerful nonlinear methods, presenting in-depth treatments of them, and showing which methods are most effective for different classes of practical nontrivial problems.

Causality. --- Causation. --- Extrapolation. --- Population Characteristics. --- Research Design. --- Extrapolation --- 519.6 --- 681.3*G11 --- 681.3*G11 Interpolation: difference formulas; extrapolation; smoothing; spline and piecewise polynomial interpolation (Numerical analysis) --- Interpolation: difference formulas; extrapolation; smoothing; spline and piecewise polynomial interpolation (Numerical analysis) --- 519.6 Computational mathematics. Numerical analysis. Computer programming --- Computational mathematics. Numerical analysis. Computer programming --- Approximation theory --- Numerical analysis

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Evolving from an elementary discussion, this book develops the Euclidean algorithm to a very powerful tool to deal with general continued fractions, non-normal Padé tables, look-ahead algorithms for Hankel and Toeplitz matrices, and for Krylov subspace methods. It introduces the basics of fast algorithms for structured problems and shows how they deal with singular situations. Links are made with more applied subjects such as linear system theory and signal processing, and with more advanced topics and recent results such as general bi-orthogonal polynomials, minimal Padé approximation, poly

Ordered algebraic structures --- Numerical approximation theory --- Computer science --- lineaire algebra --- Algebras, Linear --- Euclidean algorithm --- Orthogonal polynomials --- Padé approximant --- #TELE:SISTA --- 519.6 --- 681.3*G11 --- 681.3*G12 --- 681.3*G13 --- Algorithm of Euclid --- Continued division --- Division, Continued --- Euclid algorithm --- Euclidian algorithm --- Euclid's algorithm --- Algorithms --- Number theory --- Linear algebra --- Algebra, Universal --- Generalized spaces --- Mathematical analysis --- Calculus of operations --- Line geometry --- Topology --- 681.3*G13 Numerical linear algebra: conditioning; determinants; Eigenvalues; error analysis; linear systems; matrix inversion; pseudoinverses; sparse and very largesystems --- Numerical linear algebra: conditioning; determinants; Eigenvalues; error analysis; linear systems; matrix inversion; pseudoinverses; sparse and very largesystems --- 681.3*G12 Approximation: chebyshev; elementary function; least squares; linear approximation; minimax approximation and algorithms; nonlinear and rational approximation; spline and piecewise polynomial approximation (Numerical analysis) --- Approximation: chebyshev; elementary function; least squares; linear approximation; minimax approximation and algorithms; nonlinear and rational approximation; spline and piecewise polynomial approximation (Numerical analysis) --- 681.3*G11 Interpolation: difference formulas; extrapolation; smoothing; spline and piecewise polynomial interpolation (Numerical analysis) --- Interpolation: difference formulas; extrapolation; smoothing; spline and piecewise polynomial interpolation (Numerical analysis) --- 519.6 Computational mathematics. Numerical analysis. Computer programming --- Computational mathematics. Numerical analysis. Computer programming --- Fourier analysis --- Functions, Orthogonal --- Polynomials --- Approximant, Padé --- Approximation theory --- Continued fractions --- Power series --- Euclidean algorithm. --- Algebras, Linear. --- Padé approximant. --- Orthogonal polynomials. --- Padé approximant. --- Pade approximant.