George Labahn

ACM Trans. Algorithms, October, 2023

Computing critical points for invariant algebraic systems.

[BibT_eX]

[DOI]

J. Symb. Comput., 2023

Special issue on Symbolic and Algebraic Computation: ISSAC 2021.

[BibT_eX]

[DOI]

Frédéric Chyzak

J. Symb. Comput., 2023

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

[BibT_eX]

[DOI]

J. Symb. Comput., 2023

Faster real root decision algorithm for symmetric polynomials.

[BibT_eX]

[DOI]

Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, 2023

2022

Efficient rational creative telescoping.

[BibT_eX]

[DOI]

J. Symb. Comput., 2022

Constructing minimal telescopers for rational functions in three discrete variables.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2022

Rank-Sensitive Computation of the Rank Profile of a Polynomial Matrix.

[BibT_eX]

[DOI]

Proceedings of the ISSAC '22: International Symposium on Symbolic and Algebraic Computation, Villeneuve-d'Ascq, France, July 4, 2022

Bohemian Matrix Geometry.

[BibT_eX]

[DOI]

Proceedings of the ISSAC '22: International Symposium on Symbolic and Algebraic Computation, Villeneuve-d'Ascq, France, July 4, 2022

2021

Efficient <i>q</i>-integer linear decomposition of multivariate polynomials.

[BibT_eX]

[DOI]

J. Symb. Comput., 2021

Computing nearby non-trivial Smith forms.

[BibT_eX]

[DOI]

Joseph Haraldson

J. Symb. Comput., 2021

Homotopy techniques for solving sparse column support determinantal polynomial systems.

[BibT_eX]

[DOI]

J. Complex., 2021

2020

Foreword.

[BibT_eX]

[DOI]

James H. Davenport

Josef Urban

Math. Comput. Sci., 2020

Computing lower rank approximations of matrix polynomials.

[BibT_eX]

[DOI]

Joseph Haraldson

J. Symb. Comput., 2020

Efficient q-Integer Linear Decomposition of Multivariate Polynomials.

[BibT_eX]

[DOI]

CoRR, 2020

A Las Vegas algorithm for computing the smith form of a nonsingular integer matrix.

[BibT_eX]

[DOI]

Proceedings of the ISSAC '20: International Symposium on Symbolic and Algebraic Computation, 2020

Dowsing for Math Answers with Tangent-L.

[BibT_eX]

[DOI]

Proceedings of the Working Notes of CLEF 2020, 2020

2019

Efficient Integer-Linear Decomposition of Multivariate Polynomials.

[BibT_eX]

[DOI]

Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, 2019

Deterministic Reduction of Integer Nonsingular Linear System Solving to Matrix Multiplication.

[BibT_eX]

[DOI]

Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, 2019

2018

Convergence of Implicit Schemes for Hamilton-Jacobi-Bellman Quasi-Variational Inequalities.

[BibT_eX]

[DOI]

Parsiad Azimzadeh

Erhan Bayraktar

SIAM J. Control. Optim., 2018

On rational functions without Froissart doublets.

[BibT_eX]

[DOI]

Ana C. Matos

Numerische Mathematik, 2018

2017

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

[BibT_eX]

[DOI]

Vincent Neiger

J. Complex., 2017

Computing the Nearest Rank-Deficient Matrix Polynomial.

[BibT_eX]

[DOI]

Joseph Haraldson

Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, 2017

2016

Computation of invariants of finite abelian groups.

[BibT_eX]

[DOI]

Evelyne Hubert

Math. Comput., 2016

A fast, deterministic algorithm for computing a Hermite Normal Form of a polynomial matrix.

[BibT_eX]

[DOI]

CoRR, 2016

Thematic program in computer algebra: July 1 - Dec 31, 2015.

[BibT_eX]

[DOI]

Stephen M. Watt

ACM Commun. Comput. Algebra, 2016

Existence Problem of Telescopers: Beyond the Bivariate Case.

[BibT_eX]

[DOI]

Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, 2016

2015

A Bayesian model for recognizing handwritten mathematical expressions.

[BibT_eX]

[DOI]

Scott MacLean

Pattern Recognit., 2015

A deterministic algorithm for inverting a polynomial matrix.

[BibT_eX]

[DOI]

J. Complex., 2015

Sparse modelling and multi-exponential analysis (Dagstuhl Seminar 15251).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2015

Rational invariants of finite abelian groups.

[BibT_eX]

[DOI]

ACM Commun. Comput. Algebra, 2015

Dynamical systems and scaling invariants.

[BibT_eX]

[DOI]

ACM Commun. Comput. Algebra, 2015

2014

A Comparison of Iterated Optimal Stopping and Local Policy Iteration for American Options Under Regime Switching.

[BibT_eX]

[DOI]

Josh Babbin

J. Sci. Comput., 2014

Fast and deterministic computation of the determinant of a polynomial matrix.

[BibT_eX]

[DOI]

CoRR, 2014

Unimodular completion of polynomial matrices.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2014

2013

Energy Shaping for Systems with Two Degrees of Underactuation and More than Three Degrees of Freedom.

[BibT_eX]

[DOI]

Wai Man Ng

Dong Eui Chang

SIAM J. Control. Optim., 2013

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

[BibT_eX]

[DOI]

J. Symb. Comput., 2013

A new approach for recognizing handwritten mathematics using relational grammars and fuzzy sets.

[BibT_eX]

[DOI]

Scott MacLean

Int. J. Document Anal. Recognit., 2013

Scaling Invariants and Symmetry Reduction of Dynamical Systems.

[BibT_eX]

[DOI]

Evelyne Hubert

Found. Comput. Math., 2013

Computing column bases of polynomial matrices.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2013

2012

Combined Fixed Point and Policy Iteration for Hamilton-Jacobi-Bellman Equations in Finance.

[BibT_eX]

[DOI]

Y. Huang

SIAM J. Numer. Anal., 2012

Iterative methods for the solution of a singular control formulation of a GMWB pricing problem.

[BibT_eX]

[DOI]

Y. Huang

Numerische Mathematik, 2012

Efficient algorithms for order basis computation.

[BibT_eX]

[DOI]

J. Symb. Comput., 2012

Gröbner walk for computing matrix normal forms over Ore polynomials.

[BibT_eX]

[DOI]

Johannes Middeke

ACM Commun. Comput. Algebra, 2012

Computing minimal nullspace bases.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2012

Rational invariants of scalings from Hermite normal forms.

[BibT_eX]

[DOI]

Evelyne Hubert

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2012

2011

Methods for Pricing American Options under Regime Switching.

[BibT_eX]

[DOI]

Y. Huang

SIAM J. Sci. Comput., 2011

Grammar-based techniques for creating ground-truthed sketch corpora.

[BibT_eX]

[DOI]

Int. J. Document Anal. Recognit., 2011

Is the iPad useful for sketch input? A comparison with the Tablet PC.

[BibT_eX]

[DOI]

Proceedings of the 8th ACM SIGGRAPH / Eurographics Symposium on Sketch-Based Interfaces and Modeling, 2011

Analyzing sketch content using in-air packet information.

[BibT_eX]

[DOI]

Proceedings of the 16th International Conference on Intelligent User Interfaces, 2011

2009

Symbolic-numeric sparse interpolation of multivariate polynomials.

[BibT_eX]

[DOI]

Wen-shin Lee

J. Symb. Comput., 2009

Applying linear algebra routines to modular ore polynomial matrix algorithms.

[BibT_eX]

[DOI]

ACM Commun. Comput. Algebra, 2009

Tools for the Efficient Generation of Hand-Drawn Corpora Based on Context-Free Grammars.

[BibT_eX]

[DOI]

Proceedings of the 6th ACM SIGGRAPH / Eurographics Symposium on Sketch-Based Interfaces and Modeling, 2009

Efficient computation of order bases.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2009

Fraction-free computation of simultaneous padé approximants.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2009

Computing Popov Forms of Matrices Over PBW Extensions.

[BibT_eX]

[DOI]

Yang Zhang

Proceedings of the Computer Mathematics, 2009

A Practical Implementation of a Modular Algorithm for Ore Polynomial Matrices.

[BibT_eX]

[DOI]

Proceedings of the Computer Mathematics, 2009

2008

Computing polynomial LCM and GCD in lagrange basis.

[BibT_eX]

[DOI]

ACM Commun. Comput. Algebra, 2008

MathBrush: A Case Study for Pen-based Interactive Mathematics.

[BibT_eX]

[DOI]

Proceedings of the 5th Eurographics Workshop on Sketch-Based Interfaces and Modeling, 2008

MathBrush: A System for Doing Math on Pen-Based Devices.

[BibT_eX]

[DOI]

Proceedings of the Eighth IAPR International Workshop on Document Analysis Systems, 2008

2007

On the numerical condition of a generalized Hankel eigenvalue problem.

[BibT_eX]

[DOI]

Gene H. Golub

Numerische Mathematik, 2007

Output-sensitive modular algorithms for polynomial matrix normal forms.

[BibT_eX]

[DOI]

J. Symb. Comput., 2007

Managing Ambiguity in Mathematical Matrices.

[BibT_eX]

[DOI]

Proceedings of the 4th Eurographics Workshop on Sketch-Based Interfaces and Modeling, 2007

2006

Normal forms for general polynomial matrices.

[BibT_eX]

[DOI]

Gilles Villard

J. Symb. Comput., 2006

Fraction-free row reduction of matrices of Ore polynomials.

[BibT_eX]

[DOI]

J. Symb. Comput., 2006

On computing polynomial GCDs in alternate bases.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2006

MathBrush: An Experimental Pen-Based Math System.

[BibT_eX]

[DOI]

Proceedings of the Challenges in Symbolic Computation Software, 02.07. - 07.07.2006, 2006

Probabilistically Stable Numerical Sparse Polynomial Interpolation.

[BibT_eX]

[DOI]

Wen-shin Lee

Proceedings of the Challenges in Symbolic Computation Software, 02.07. - 07.07.2006, 2006

2005

A Semi-Lagrangian Approach for American Asian Options under Jump Diffusion.

[BibT_eX]

[DOI]

Yann d'Halluin

SIAM J. Sci. Comput., 2005

Computing Valuation Popov Forms.

[BibT_eX]

[DOI]

Yang Zhang

Proceedings of the Computational Science, 2005

2004

A penalty method for American options with jump diffusion processes.

[BibT_eX]

[DOI]

Yann d'Halluin

Numerische Mathematik, 2004

Hyperexponential solutions of finite-rank ideals in orthogonal ore rings.

[BibT_eX]

[DOI]

Ziming Li

Proceedings of the Symbolic and Algebraic Computation, 2004

Closed form solutions of linear odes having elliptic function coefficients.

[BibT_eX]

[DOI]

Reinhold Burger

Mark van Hoeij

Proceedings of the Symbolic and Algebraic Computation, 2004

2002

Fraction-free row reduction of matrices of skew polynomials.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, 2002

2001

Computing all factorizations in ***.

[BibT_eX]

[DOI]

Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation, 2001

2000

Fraction-Free Computation of Matrix Rational Interpolants and Matrix GCDs.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., 2000

Effective Computation of Rational Approximants and Interpolants.

[BibT_eX]

[DOI]

Reliab. Comput., 2000

Numerical methods for pricing callable bonds.

[BibT_eX]

[DOI]

Proceedings of the IEEE/IAFE/INFORMS 2000 Conference on Computational Intelligence for Financial Engineering, 2000

1999

Shifted Normal Forms of Polynomial Matrices.

[BibT_eX]

[DOI]

Gilles Villard

Proceedings of the 1999 International Symposium on Symbolic and Algebraic Computation, 1999

1998

A Fast and Numerically Stable Euclidean-Like Algorithm for Detecting Relatively Prime Numerical Polynomials.

[BibT_eX]

[DOI]

J. Symb. Comput., 1998

When are Two Numerical Polynomials Relatively Prime?

[BibT_eX]

[DOI]

J. Symb. Comput., 1998

Poster Session Abstracts of the 1998 International Symposium on Symbolic and Algebraic Computation, ISSAC 1998 Rostock, Germany August 13 - 15, 1998.

[BibT_eX]

[DOI]

Mohamed Omar Rayes

SIGSAM Bull., 1998

1997

Algorithm 766: Experiments with a Weakly Stable Algorithm for Computing Padé-Hermite and Simultaneous Padé Approximants.

[BibT_eX]

[DOI]

Anthony R. Jones

ACM Trans. Math. Softw., 1997

Integration of the Signum, Piecewise and Related Functions.

[BibT_eX]

[DOI]

David J. Jeffrey

Martin von Mohrenschildt

Albert D. Rich

Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation, 1997

Fraction-free Computation of Catrix Padé Systems.

[BibT_eX]

[DOI]

Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation, 1997

1996

Computation of Numerical Padé-Hermite and Simultaneous Padé Systems II: A Weakly Stable Algorithm.

[BibT_eX]

[DOI]

Anthony R. Jones

SIAM J. Matrix Anal. Appl., 1996

Computation of Numerical Padé-Hermite and Simultaneous Padé Systems I: Near Inversion of Generalized Sylvester Matrices.

[BibT_eX]

[DOI]

Anthony R. Jones

SIAM J. Matrix Anal. Appl., 1996

Asymptotically Fast Computation of Hermite Normal Forms of Integer Matrices.

[BibT_eX]

[DOI]

Proceedings of the 1996 International Symposium on Symbolic and Algebraic Computation, 1996

1995

Preconditioning of Rectangular Polynomial Matrices for Efficient Hermite Normal Form Computation.

[BibT_eX]

[DOI]

Proceedings of the 1995 International Symposium on Symbolic and Algebraic Computation, 1995

1994

A Uniform Approach for the Fast Computation of Matrix-Type Padé Approximants.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., July, 1994

1992

A superfast algorithm for multi-dimensional Padé systems.

[BibT_eX]

[DOI]

Numer. Algorithms, 1992

A uniform approach for Hermite Padé and simultaneous Padé approximants and their matrix-type generalizations.

[BibT_eX]

[DOI]

Numer. Algorithms, 1992

Algorithms for computer algebra.

[BibT_eX]

Keith O. Geddes

Stephen R. Czapor

Kluwer, ISBN: 978-0-7923-9259-0, 1992

1990

The Inverses of Block Hankel and Block Toeplitz Matrices.

[BibT_eX]

[DOI]

Dong-Koo Choi

SIAM J. Comput., 1990

1989

Matrix Padé Fractions and Their Computation.

[BibT_eX]

[DOI]

SIAM J. Comput., 1989

A Fast, Reliable Algorithm for Calculating Padé-Hermite Forms.

[BibT_eX]

[DOI]

Proceedings of the ACM-SIGSAM 1989 International Symposium on Symbolic and Algebraic Computation, 1989

1987

Matrix-Padé fractions.

[BibT_eX]

[DOI]