Algorithm 79. An algorithm for Fourier series expansion in a subinterval of the circumference
J. Mączyński (1980)
Applicationes Mathematicae
Similarity:
J. Mączyński (1980)
Applicationes Mathematicae
Similarity:
William W. Hager (1986/87)
Numerische Mathematik
Similarity:
H. Weber (1980/81)
Numerische Mathematik
Similarity:
E. Ayachour (1999)
Applicationes Mathematicae
Similarity:
In the non-normal case, it is possible to use various look-ahead strategies for computing the elements of a family of regular orthogonal polynomials. These strategies consist in jumping over non-existing and singular orthogonal polynomials by solving triangular linear systems. We show how to avoid them by using a new method called ALA (Avoiding Look-Ahead), for which we give three principal implementations. The application of ALA to Padé approximation, extrapolation methods and Lanczos...
J. Kuczyński (1988)
Applicationes Mathematicae
Similarity:
Krystyna Jerzykiewicz (1971)
Applicationes Mathematicae
Similarity:
Stephan Ruscheweyh (1984)
Numerische Mathematik
Similarity:
Li, T.Y., Wang, Xiaoshen (1998)
Beiträge zur Algebra und Geometrie
Similarity:
Borwein, Peter, Mossinghoff, Michael J. (2000)
Experimental Mathematics
Similarity:
Claude Brezinski (2002)
RACSAM
Similarity:
This paper is an introduction to formal orthogonal polynomials and their application to Padé approximation, Krylov subspace methods for the solution of systems of linear equations, and convergence acceleration methods. Some more general formal orthogonal polynomials, and the concept of biorthogonality and its applications are also discussed.
P. Henrici (1979)
Numerische Mathematik
Similarity:
Manuel D. Ortigueira, António S. Serralheiro, J. A. Tenreiro Machado (2015)
Waves, Wavelets and Fractals
Similarity:
This paper presents a novel zoom transform algorithm for a more reliable frequency estimation. In fact, in many signal processing problems exact determination of the frequency of a signal is of paramount importance. Some techniques derived from the Fast Fourier Transform (FFT), just pad the signal with enough zeros in order to better sample its Discrete-Time Fourier Transform. The proposed algorithm is based on the FFT and avoids the problems observed in the standard heuristic approaches....
Anna Bartkowiak (1975)
Applicationes Mathematicae
Similarity:
J. Kucharczyk (1972)
Applicationes Mathematicae
Similarity: