A polynomial preconditioner for the CMRH algorithm.

Lai, Jiangzhou; Lu, Linzhang; Xu, Shiji

Displaying similar documents to “A polynomial preconditioner for the CMRH algorithm.”

Algorithm 7. Evaluation of a trigonometric polynomial

Lucja Sobich (1970)

Applicationes Mathematicae

Similarity:

Integral minimalisations improvement for Murphy's polynomial selection algorithm.

Jedlička, Přemysl (2010)

Analele Ştiinţifice ale Universităţii “Ovidius" Constanţa. Seria: Matematică

Similarity:

Improvements on the Cantor-Zassenhaus factorization algorithm

Michele Elia, Davide Schipani (2015)

Mathematica Bohemica

Similarity:

The paper presents a careful analysis of the Cantor-Zassenhaus polynomial factorization algorithm, thus obtaining tight bounds on the performances, and proposing useful improvements. In particular, a new simplified version of this algorithm is described, which entails a lower computational cost. The key point is to use linear test polynomials, which not only reduce the computational burden, but can also provide good estimates and deterministic bounds of the number of operations needed...

BiCGstab( $l$ ) for linear equations involving unsymmetric matrices with complex spectrum.

Sleijpen, Gerard L.G., Fokkema, Diederik R. (1993)

ETNA. Electronic Transactions on Numerical Analysis [electronic only]

Similarity:

Discrete-time symmetric polynomial equations with complex coefficients

Didier Henrion, Jan Ježek, Michael Šebek (2002)

Kybernetika

Similarity:

Discrete-time symmetric polynomial equations with complex coefficients are studied in the scalar and matrix case. New theoretical results are derived and several algorithms are proposed and evaluated. Polynomial reduction algorithms are first described to study theoretical properties of the equations. Sylvester matrix algorithms are then developed to solve numerically the equations. The algorithms are implemented in the Polynomial Toolbox for Matlab.