A unified approach to some strategies for the treatment of breakdown in Lanczos-type algorithms

A. El Guennouni

Displaying similar documents to “A unified approach to some strategies for the treatment of breakdown in Lanczos-type algorithms”

Orthogonal polynomials and the Lanczos method

C. Brezinski, H. Sadok, M. Redivo Zaglia (1994)

Banach Center Publications

Similarity:

Lanczos method for solving a system of linear equations is well known. It is derived from a generalization of the method of moments and one of its main interests is that it provides the exact answer in at most n steps where n is the dimension of the system. Lanczos method can be implemented via several recursive algorithms known as Orthodir, Orthomin, Orthores, Biconjugate gradient,... In this paper, we show that all these procedures can be explained within the framework of formal orthogonal...

The use of Schubert polynomials in SYMCHAR.

Kohnert, A. (1991)

Séminaire Lotharingien de Combinatoire [electronic only]

Similarity:

Symbolic computation of Appell polynomials using Maple.

Alkahby, H., Ansong, G., Frempong-Mireku, P., Jalbout, A. (2001)

Electronic Journal of Differential Equations (EJDE) [electronic only]

Similarity:

Elliptic hypergeometric Laurent biorthogonal polynomials with a dense point spectrum on the unit circle.

Tsujimoto, Satoshi, Zhedanov, Alexei (2009)

SIGMA. Symmetry, Integrability and Geometry: Methods and Applications [electronic only]

Similarity:

S-orthogonality on the semicircle

Marija Stanić (2004)

Kragujevac Journal of Mathematics

Similarity:

Nonnegative linearization of orthogonal polynomials

Ryszard Szwarc (1996)

Colloquium Mathematicae

Similarity:

When is the algebra of multisymmetric polynomials generated by the elementary multisymmetric polynomials?

Briand, Emmanuel (2004)

Beiträge zur Algebra und Geometrie

Similarity:

Finding Liouvillian first integrals of rational ODEs of any order in finite terms.

Kosovtsov, Yuri N. (2006)

SIGMA. Symmetry, Integrability and Geometry: Methods and Applications [electronic only]

Similarity:

The identity of three classes of polynomials.

Vernescu, Andrei (2005)

General Mathematics

Similarity:

On real polynomials without nonnegative roots.

Brunotte, Horst (2009)

Acta Mathematica Academiae Paedagogicae Nyí regyháziensis. New Series [electronic only]

Similarity:

The Rahman polynomials are bispectral.

Grünbaum, F. Alberto (2007)

SIGMA. Symmetry, Integrability and Geometry: Methods and Applications [electronic only]

Similarity:

Factoring polynomials over global fields

Karim Belabas, Mark van Hoeij, Jürgen Klüners, Allan Steel (2009)

Journal de Théorie des Nombres de Bordeaux

Similarity:

We prove that van Hoeij’s original algorithm to factor univariate polynomials over the rationals runs in polynomial time, as well as natural variants. In particular, our approach also yields polynomial time complexity results for bivariate polynomials over a finite field.