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...

Probabilistic analysis of block Wiedemann for leading invariant factors

Journal of symbolic computation, 2022-01, Vol.108, p.98-116

2022

Volltextzugriff (PDF)

On wiedemann's method of solving sparse linear systems

Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 2005, p.29-38

2005

Volltextzugriff (PDF)

Probabilistic analysis of Wiedemann's algorithm for minimal polynomial computation

Journal of symbolic computation, 2016-05, Vol.74, p.55-69

2016

Volltextzugriff (PDF)

Matrix rank certification

Electronic Journal of Linear Algebra, 2014-11, Vol.27 (1)

2014

Volltextzugriff (PDF)

Sparse polynomial interpolation in nonstandard bases

SIAM journal on computing, 1995-04, Vol.24 (2), p.387-397

1995

Volltextzugriff (PDF)

On Parametric Linear System Solving

Computer Algebra in Scientific Computing, 2020, Vol.12291, p.188-205

2020

Volltextzugriff (PDF)

Fast computation of Smith forms of sparse matrices over local rings

Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation, 2012, p.146-153

2012

Volltextzugriff (PDF)

Parallel algorithms for matrix normal forms

Linear algebra and its applications, 1990-07, Vol.136, p.189-208

1990

Volltextzugriff (PDF)

Sparse shifts for univariate polynomials

Applicable algebra in engineering, communication and computing, 1996, Vol.7 (5), p.351-364

1996

Volltextzugriff (PDF)

LinBox Founding Scope Allocation, Parallel Building Blocks, and Separate Compilation

Mathematical Software – ICMS 2010, p.77-83

Volltextzugriff (PDF)

Signature of symmetric rational matrices and the unitary dual of lie groups

International Conference on Symbolic and Algebraic Computation: Proceedings of the 2005 international symposium on Symbolic and algebraic computation; 24-27 July 2005, 2005, p.13-20

2005

Volltextzugriff (PDF)

Efficient matrix preconditioners for black box linear algebra

Linear algebra and its applications, 2002-03, Vol.343, p.119-146

2002

Volltextzugriff (PDF)

On Efficient Sparse Integer Matrix Smith Normal Form Computations

Journal of symbolic computation, 2001-07, Vol.32 (1-2), p.71-99

2001

Volltextzugriff (PDF)

Numerical techniques for computing the inertia of products of matrices of rational numbers

International Conference on Symbolic and Algebraic Computation: Proceedings of the 2007 international workshop on Symbolic-numeric computation; 25-27 July 2007, 2007, p.125-132

2007

Volltextzugriff (PDF)

LinBox and future high performance computer algebra

International Conference on Symbolic and Algebraic Computation: Proceedings of the 2007 international workshop on Parallel symbolic computation; 27-28 July 2007, 2007, p.102-103

2007

Volltextzugriff (PDF)

Probabilistic analysis of block wiedemann for leading invariant factors

ACM communications in computer algebra, 2016-12, Vol.50 (4), p.173-175, Article 173

2016

Volltextzugriff (PDF)

Matrix rank certification

Electronic Journal of Linear Algebra, 2004, Vol.11 (1)

2004

Volltextzugriff (PDF)

Probabilistic analysis of Wiedemann's algorithm for minimal polynomial computation

ACM communications in computer algebra, 2014-01, Vol.47 (3/4), p.118-119

2014

Volltextzugriff (PDF)

Quadratic-time certificates in linear algebra

Proceedings of the 36th international symposium on Symbolic and algebraic computation, 2011, p.171-176

2011

Volltextzugriff (PDF)

Integer Smith form via the valence: experience with large sparse matrices from homology

International Conference on Symbolic and Algebraic Computation: Proceedings of the 2000 international symposium on Symbolic and algebraic computation, 2000, p.95-105

2000

Volltextzugriff (PDF)

An implementation of Kovacic's algorithm for solving second order linear homogeneous differential equations

Proceedings of the fourth ACM symposium on Symbolic and algebraic computation, 1981, p.105-108

1981

Volltextzugriff (PDF)

Efficient matrix preconditioners for black box linear algebra: Special Issue on Structured and Infinite Systems of Linear Equations

Linear algebra and its applications, 2002, Vol.343-44, p.119-146

2002

Volltextzugriff (PDF)

Abstract only: Bitslicing with matrix algorithms oblivious to the data compression

ACM communications in computer algebra, 2010-07, Vol.44 (1/2), p.26-26

2010

Volltextzugriff (PDF)

Algebra made mechanical

SIGSAM bulletin, 1981-08, Vol.15 (3), p.23-25

Saunders, B. David

1981

Volltextzugriff (PDF)

On computing sparse shifts for univariate polynomials

International Conference on Symbolic and Algebraic Computation: Proceedings of the international symposium on Symbolic and algebraic computation; 20-22 July 1994, 1994, p.108-113

1994

Volltextzugriff (PDF)

1 – 25 von 914

Menü

Weitere Dienste

Einstellungen

Probabilistic analysis of block Wiedemann for leading invariant factors

On wiedemann's method of solving sparse linear systems

Probabilistic analysis of Wiedemann's algorithm for minimal polynomial computation

Matrix rank certification

Sparse polynomial interpolation in nonstandard bases

On Parametric Linear System Solving

Fast computation of Smith forms of sparse matrices over local rings

Parallel algorithms for matrix normal forms

Sparse shifts for univariate polynomials

LinBox Founding Scope Allocation, Parallel Building Blocks, and Separate Compilation

Signature of symmetric rational matrices and the unitary dual of lie groups

Efficient matrix preconditioners for black box linear algebra

On Efficient Sparse Integer Matrix Smith Normal Form Computations

Numerical techniques for computing the inertia of products of matrices of rational numbers

LinBox and future high performance computer algebra

Probabilistic analysis of block wiedemann for leading invariant factors

Matrix rank certification

Probabilistic analysis of Wiedemann's algorithm for minimal polynomial computation

Quadratic-time certificates in linear algebra

Integer Smith form via the valence: experience with large sparse matrices from homology

An implementation of Kovacic's algorithm for solving second order linear homogeneous differential equations

Efficient matrix preconditioners for black box linear algebra: Special Issue on Structured and Infinite Systems of Linear Equations

Abstract only: Bitslicing with matrix algorithms oblivious to the data compression

Algebra made mechanical

On computing sparse shifts for univariate polynomials

Suchergebnisse filtern