UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

Computation of invariants of finite abelian groups

Mathematics of computation, 2016-11, Vol.85 (302), p.3029-3050

2016

Volltextzugriff (PDF)

Special issue on Symbolic and Algebraic Computation: ISSAC 2021

Journal of symbolic computation, 2023-05, Vol.116, p.425-426

2023

Volltextzugriff (PDF)

A fast algorithm for computing the Smith normal form with multipliers for a nonsingular integer matrix

Journal of symbolic computation, 2023-05, Vol.116, p.146-182

2023

Volltextzugriff (PDF)

Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix

Journal of Complexity, 2017-10, Vol.42, p.44-71

2017

Volltextzugriff (PDF)

Efficient algorithms for order basis computation

Journal of symbolic computation, 2012-07, Vol.47 (7), p.793-819

2012

Volltextzugriff (PDF)

Computing the Invariants of Finite Abelian Groups

Mathematics of computation, 2016-11, Vol.85 (302), p.3029-3050

2016

Volltextzugriff (PDF)

Computing nearby non-trivial Smith forms

Journal of symbolic computation, 2021-01, Vol.102, p.304-327

2021

Volltextzugriff (PDF)

Computing lower rank approximations of matrix polynomials

Journal of symbolic computation, 2020-05, Vol.98, p.225-245

2020

Volltextzugriff (PDF)

Efficient rational creative telescoping

Journal of symbolic computation, 2022-03, Vol.109, p.57-87

2022

Volltextzugriff (PDF)

On rational functions without Froissart doublets

Numerische Mathematik, 2018-03, Vol.138 (3), p.615-633

2018

Volltextzugriff (PDF)

Efficient q-integer linear decomposition of multivariate polynomials

Journal of symbolic computation, 2021-11, Vol.107, p.122-144

2021

Volltextzugriff (PDF)

On rational functions without Froissart doublets

Numerische Mathematik, 2018, Vol.138, p.615-633

2018

Volltextzugriff (PDF)

Homotopy techniques for solving sparse column support determinantal polynomial systems

Journal of Complexity, 2021-10, Vol.66, p.101557, Article 101557

2021

Volltextzugriff (PDF)

A deterministic algorithm for inverting a polynomial matrix

Journal of Complexity, 2015-04, Vol.31 (2), p.162-173

2015

Volltextzugriff (PDF)

Computing critical points for invariant algebraic systems

Journal of symbolic computation, 2023-05, Vol.116, p.365-399

2023

Volltextzugriff (PDF)

Constructing minimal telescopers for rational functions in three discrete variables

Advances in applied mathematics, 2022-10, Vol.141, p.102389, Article 102389

2022

Volltextzugriff (PDF)

Symbolic–numeric sparse interpolation of multivariate polynomials

Journal of symbolic computation, 2009-08, Vol.44 (8), p.943-959

2009

Volltextzugriff (PDF)

Normal forms for general polynomial matrices

Journal of symbolic computation, 2006-06, Vol.41 (6), p.708-737

2006

Volltextzugriff (PDF)

On simultaneous row and column reduction of higher-order linear differential systems

Journal of symbolic computation, 2013-02, Vol.49, p.45-64

2013

Volltextzugriff (PDF)

Fraction-free row reduction of matrices of Ore polynomials

Journal of symbolic computation, 2006-05, Vol.41 (5), p.513-543

2006

Volltextzugriff (PDF)

Output-sensitive modular algorithms for polynomial matrix normal forms

Journal of symbolic computation, 2007-07, Vol.42 (7), p.733-750

2007

Volltextzugriff (PDF)

Recursiveness in matrix rational interpolation problems

Journal of computational and applied mathematics, 1997-01, Vol.77 (1), p.5-34

1997

Volltextzugriff (PDF)

When are Two Numerical Polynomials Relatively Prime?

Journal of symbolic computation, 1998-12, Vol.26 (6), p.677-689

1998

Volltextzugriff (PDF)

Effective computation of rational approximants and interpolants

Reliable computing, 2000, Vol.6 (4), p.365-390

2000

Volltextzugriff (PDF)

Inversion components of block Hankel-like matrices

Linear algebra and its applications, 1992-12, Vol.177, p.7-48

Labahn, George

1992

Volltextzugriff (PDF)

1 – 25 von 33

Menü

Weitere Dienste

Einstellungen

Computation of invariants of finite abelian groups

Special issue on Symbolic and Algebraic Computation: ISSAC 2021

A fast algorithm for computing the Smith normal form with multipliers for a nonsingular integer matrix

Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix

Efficient algorithms for order basis computation

Computing the Invariants of Finite Abelian Groups

Computing nearby non-trivial Smith forms

Computing lower rank approximations of matrix polynomials

Efficient rational creative telescoping

On rational functions without Froissart doublets

Efficient q-integer linear decomposition of multivariate polynomials

On rational functions without Froissart doublets

Homotopy techniques for solving sparse column support determinantal polynomial systems

A deterministic algorithm for inverting a polynomial matrix

Computing critical points for invariant algebraic systems

Constructing minimal telescopers for rational functions in three discrete variables

Symbolic–numeric sparse interpolation of multivariate polynomials

Normal forms for general polynomial matrices

On simultaneous row and column reduction of higher-order linear differential systems

Fraction-free row reduction of matrices of Ore polynomials

Output-sensitive modular algorithms for polynomial matrix normal forms

Recursiveness in matrix rational interpolation problems

When are Two Numerical Polynomials Relatively Prime?

Effective computation of rational approximants and interpolants

Inversion components of block Hankel-like matrices

Aktive Filter

Suchergebnisse filtern