Euclidean remainders for generalized polynomials

On orthogonal polynomials transformed by the QR algorithm

Buhmann, M.
Iserles, A
Cambridge Univ. (United Kingdom). Dept. of Applied Mathematics and Theoretical Physics

January 1991

SIGLEAvailable from British Library Document Supply Centre- DSC:9106.1605(CU-DAMTP-NA--7/1991) / BLD...

Improved Polynomial Remainder Sequences for {Ore} Polynomials

Jaroschek, M.

January 2015

Polynomial remainder sequences contain the intermediate results of the Euclidean algorithm when appl...

Real zeros of random polynomials

Rezakhah Varnousfaderani, S.

January 1996

SIGLEAvailable from British Library Document Supply Centre-DSC:DXN013472 / BLDSC - British Library D...

Euclidean remainders for generalized polynomials

Barnett, Stephen

February 1988

AbstractGiven two polynomials a(λ) and b(λ) expressed in generalized form (i.e. relative to a given ...

Multiplication of generalized polynomials, with applications to classical orthogonal polynomials

Barnett, S
Bradford Univ. (United Kingdom). School of Mathematical Sciences

January 1983

Available from British Library Document Supply Centre- DSC:7673.7004(83/12) / BLDSC - British Librar...

Solution of diophantine equations for generalized polynomials

Barnett, S
Bradford Univ. (United Kingdom). School of Mathematical Sciences

January 1984

SIGLEAvailable from British Library Document Supply Centre- DSC:7673.7004(84/18) / BLDSC - British L...

Euclidean remainders and the Routh array from an observability matrix

Barnett, S
Bradford Univ. (United Kingdom). School of Mathematical Sciences

January 1986

SIGLEAvailable from British Library Document Supply Centre- DSC:7673.7004(86/34) / BLDSC - British L...

On the number of remainders in euclidean domains.

Markanda, Raj K.

August 2005

On the number of remainders in euclidean domains.Rajagopalan K., Markanda10 págs.Nivel analíticoseme...

Computation of the generalized inverse of a polynomial matrix

Karampetakis, N
Loughborough Univ. of Technology (United Kingdom). Dept. of Mathematical Sciences

January 1995

Also known as Mathematical sciences report A no. 243SIGLEAvailable from British Library Document Sup...

Gröbner Bases: A Natural Extension of Gaussian Reduction and the Euclidean Algorithm (Abstract)

Flinn, Patrick

January 2005

Gröbner bases can be used to answer fundamental questions concerning certain sets of polynomials. Fo...

Univariate multiquadric approximation Reproduction of linear polynomials

Powell, M
Cambridge Univ. (United Kingdom). Dept. of Applied Mathematics and Theoretical Physics

January 1990

SIGLEAvailable from British Library Document Supply Centre- DSC:9106.1605(DAMTP-NA--1990/2) / BLDSC ...

Random polynomials

Hannigan, P.

January 1998

SIGLEAvailable from British Library Document Supply Centre-DSC:DXN020838 / BLDSC - British Library D...

&Lambda;-Generalized Polynomials with Applications to Multivariable Decoupling

J. Ruiz-Leon
D. Henrion

November 2007

This work is intended to be a continuation of previous studies about a set of rational functions, k...

Implementing the Thull-Yap algorithm for computing Euclidean remainder sequences

Morain, François

July 2022

International audienceThere are two types of integer gcd algorithms: those which compute the sequenc...

Notas de Matemática

March 2006

On the number of remainders in euclidean domains.Rajagopalan K., MarkandaNivel monográficosemestra

On orthogonal polynomials transformed by the QR algorithm

Buhmann, M.
Iserles, A
Cambridge Univ. (United Kingdom). Dept. of Applied Mathematics and Theoretical Physics

January 1991

SIGLEAvailable from British Library Document Supply Centre- DSC:9106.1605(CU-DAMTP-NA--7/1991) / BLD...

Improved Polynomial Remainder Sequences for {Ore} Polynomials

Jaroschek, M.

January 2015

Polynomial remainder sequences contain the intermediate results of the Euclidean algorithm when appl...

Real zeros of random polynomials

Rezakhah Varnousfaderani, S.

January 1996

SIGLEAvailable from British Library Document Supply Centre-DSC:DXN013472 / BLDSC - British Library D...

Euclidean remainders for generalized polynomials

Barnett, Stephen

February 1988

AbstractGiven two polynomials a(λ) and b(λ) expressed in generalized form (i.e. relative to a given ...

Multiplication of generalized polynomials, with applications to classical orthogonal polynomials

Barnett, S
Bradford Univ. (United Kingdom). School of Mathematical Sciences

January 1983

Available from British Library Document Supply Centre- DSC:7673.7004(83/12) / BLDSC - British Librar...

Solution of diophantine equations for generalized polynomials

Barnett, S
Bradford Univ. (United Kingdom). School of Mathematical Sciences

January 1984

SIGLEAvailable from British Library Document Supply Centre- DSC:7673.7004(84/18) / BLDSC - British L...

Euclidean remainders and the Routh array from an observability matrix

Barnett, S
Bradford Univ. (United Kingdom). School of Mathematical Sciences

January 1986

SIGLEAvailable from British Library Document Supply Centre- DSC:7673.7004(86/34) / BLDSC - British L...

On the number of remainders in euclidean domains.

Markanda, Raj K.

August 2005

On the number of remainders in euclidean domains.Rajagopalan K., Markanda10 págs.Nivel analíticoseme...

Computation of the generalized inverse of a polynomial matrix

Karampetakis, N
Loughborough Univ. of Technology (United Kingdom). Dept. of Mathematical Sciences

January 1995

Also known as Mathematical sciences report A no. 243SIGLEAvailable from British Library Document Sup...

Gröbner Bases: A Natural Extension of Gaussian Reduction and the Euclidean Algorithm (Abstract)

Flinn, Patrick

January 2005

Gröbner bases can be used to answer fundamental questions concerning certain sets of polynomials. Fo...

Univariate multiquadric approximation Reproduction of linear polynomials

Powell, M
Cambridge Univ. (United Kingdom). Dept. of Applied Mathematics and Theoretical Physics

January 1990

SIGLEAvailable from British Library Document Supply Centre- DSC:9106.1605(DAMTP-NA--1990/2) / BLDSC ...

Random polynomials

Hannigan, P.

January 1998

SIGLEAvailable from British Library Document Supply Centre-DSC:DXN020838 / BLDSC - British Library D...

&Lambda;-Generalized Polynomials with Applications to Multivariable Decoupling

J. Ruiz-Leon
D. Henrion

November 2007

This work is intended to be a continuation of previous studies about a set of rational functions, k...

Implementing the Thull-Yap algorithm for computing Euclidean remainder sequences

Morain, François

July 2022

International audienceThere are two types of integer gcd algorithms: those which compute the sequenc...

Notas de Matemática

March 2006

On the number of remainders in euclidean domains.Rajagopalan K., MarkandaNivel monográficosemestra

On orthogonal polynomials transformed by the QR algorithm

Buhmann, M.
Iserles, A
Cambridge Univ. (United Kingdom). Dept. of Applied Mathematics and Theoretical Physics

January 1991

SIGLEAvailable from British Library Document Supply Centre- DSC:9106.1605(CU-DAMTP-NA--7/1991) / BLD...

Improved Polynomial Remainder Sequences for {Ore} Polynomials

Jaroschek, M.

January 2015

Polynomial remainder sequences contain the intermediate results of the Euclidean algorithm when appl...

Real zeros of random polynomials

Rezakhah Varnousfaderani, S.

January 1996

SIGLEAvailable from British Library Document Supply Centre-DSC:DXN013472 / BLDSC - British Library D...

Euclidean remainders for generalized polynomials

Abstract

Extracted data

Euclidean remainders for generalized polynomials

Abstract

Extracted data

Related items

Related items