George Labahn

From MaRDI portal
Revision as of 13:19, 7 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page George Labahn to George Labahn: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:372873

Available identifiers

zbMath Open labahn.georgeMaRDI QIDQ372873

List of research outcomes





PublicationDate of PublicationType
Rank-sensitive computation of the rank profile of a polynomial matrix2025-01-17Paper
Bohemian matrix geometry2025-01-17Paper
Faster real root decision algorithm for symmetric polynomials2023-11-03Paper
A Cubic Algorithm for Computing the Hermite Normal Form of a Nonsingular Integer Matrix2023-10-23Paper
A fast algorithm for computing the Smith normal form with multipliers for a nonsingular integer matrix2022-11-21Paper
Computing critical points for invariant algebraic systems2022-11-21Paper
Constructing minimal telescopers for rational functions in three discrete variables2022-08-31Paper
Rank-Sensitive Computation of the Rank Profile of a Polynomial Matrix2022-02-18Paper
Bohemian Matrix Geometry2022-02-15Paper
Efficient rational creative telescoping2021-09-29Paper
Homotopy techniques for solving sparse column support determinantal polynomial systems2021-09-02Paper
Efficient \(q\)-integer linear decomposition of multivariate polynomials2021-06-03Paper
A Las Vegas algorithm for computing the smith form of a nonsingular integer matrix2021-01-22Paper
Computing nearby non-trivial Smith forms2020-09-19Paper
Deterministic Reduction of Integer Nonsingular Linear System Solving to Matrix Multiplication2020-09-10Paper
Efficient Integer-Linear Decomposition of Multivariate Polynomials2020-09-10Paper
Computing nearby non-trivial Smith forms2020-09-09Paper
Computing the Nearest Rank-Deficient Matrix Polynomial2020-09-09Paper
Computing lower rank approximations of matrix polynomials2020-01-15Paper
Convergence of Implicit Schemes for Hamilton--Jacobi--Bellman Quasi-Variational Inequalities2018-11-09Paper
A Bayesian model for recognizing handwritten mathematical expressions2018-09-03Paper
On rational functions without Froissart doublets2018-04-10Paper
Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix2017-09-07Paper
Existence Problem of Telescopers2017-05-10Paper
Computing column bases of polynomial matrices2017-02-10Paper
Computing all factorizations in ***2017-02-03Paper
On computing polynomial GCDs in alternate bases2017-02-03Paper
Symbolic-numeric sparse interpolation of multivariate polynomials2017-02-03Paper
Computation of invariants of finite abelian groups2016-07-25Paper
A Practical Implementation of a Modular Algorithm for Ore Polynomial Matrices2016-04-12Paper
Computing Popov Forms of Matrices Over PBW Extensions2016-04-12Paper
Unimodular completion of polynomial matrices2015-11-11Paper
Rational invariants of scalings from Hermite normal forms2015-03-27Paper
Computing minimal nullspace bases2015-03-27Paper
A deterministic algorithm for inverting a polynomial matrix2015-02-06Paper
Inexact arithmetic considerations for direct control and penalty methods: American options under jump diffusion2014-10-31Paper
A comparison of iterated optimal stopping and local policy iteration for American options under regime switching2014-10-10Paper
Scaling invariants and symmetry reduction of dynamical systems2013-10-21Paper
Energy Shaping for Systems with Two Degrees of Underactuation and More than Three Degrees of Freedom2013-07-17Paper
On simultaneous row and column reduction of higher-order linear differential systems2013-01-10Paper
Combined Fixed Point and Policy Iteration for Hamilton--Jacobi--Bellman Equations in Finance2012-10-31Paper
Iterative methods for the solution of a singular control formulation of a GMWB pricing problem2012-09-19Paper
Efficient algorithms for order basis computation2012-05-23Paper
Fraction-free computation of simultaneous padé approximants2012-05-13Paper
Efficient computation of order bases2012-05-13Paper
Methods for Pricing American Options under Regime Switching2012-02-23Paper
Matrix Padé fractions2011-04-16Paper
https://portal.mardi4nfdi.de/entity/Q51882272010-03-10Paper
https://portal.mardi4nfdi.de/entity/Q51882302010-03-10Paper
Valuing the Guaranteed Minimum Death Benefit Clause with Partial Withdrawals2010-01-25Paper
Symbolic-numeric sparse interpolation of multivariate polynomials2009-06-11Paper
Output-sensitive modular algorithms for polynomial matrix normal forms2008-02-13Paper
Fraction-free row reduction of matrices of Ore polynomials.2007-10-23Paper
Normal forms for general polynomial matrices2007-10-23Paper
On the numerical condition of a generalized Hankel eigenvalue problem2007-04-26Paper
https://portal.mardi4nfdi.de/entity/Q34166542007-01-22Paper
https://portal.mardi4nfdi.de/entity/Q34167042007-01-22Paper
Computational Science – ICCS 20052005-11-30Paper
A Semi-Lagrangian Approach for American Asian Options under Jump Diffusion2005-09-22Paper
https://portal.mardi4nfdi.de/entity/Q46606792005-04-04Paper
https://portal.mardi4nfdi.de/entity/Q46573022005-03-14Paper
Hyperexponential solutions of finite-rank ideals in orthogonal ore rings2005-03-14Paper
A penalty method for American options with jump diffusion processes2004-12-13Paper
https://portal.mardi4nfdi.de/entity/Q47904362003-06-01Paper
A numerical PDE approach for pricing callable bonds2002-09-05Paper
Effective computation of rational approximants and interpolants2001-09-25Paper
Fraction-Free Computation of Matrix Rational Interpolants and Matrix GCDs2001-03-19Paper
Recursiveness in matrix rational interpolation problems2001-01-15Paper
PERTURBATIVE SOLUTIONS OF QUANTUM MECHANICAL PROBLEMS BY SYMBOLIC COMPUTATION: A REVIEW2000-07-05Paper
https://portal.mardi4nfdi.de/entity/Q49383742000-02-23Paper
A fast and numerically stable Euclidean-like algorithm for detecting relatively prime numerical polynomials2000-02-03Paper
https://portal.mardi4nfdi.de/entity/Q42269821999-07-06Paper
https://portal.mardi4nfdi.de/entity/Q42272831999-06-21Paper
When are two numerical polynomials relatively prime?1999-05-16Paper
https://portal.mardi4nfdi.de/entity/Q42269501999-02-23Paper
https://portal.mardi4nfdi.de/entity/Q42273511999-02-23Paper
Algorithm 766: experiments with a weakly stable algorithm for computing Padé-Hermite and simultaneous Padé approximants1998-06-04Paper
https://portal.mardi4nfdi.de/entity/Q43826051998-03-19Paper
A fast Las Vegas algorithm for computing the Smith normal form of a polynomial matrix1998-02-16Paper
https://portal.mardi4nfdi.de/entity/Q43594701997-10-12Paper
https://portal.mardi4nfdi.de/entity/Q56904721997-01-16Paper
Computation of Numerical Padé–Hermite and Simultaneous Padé Systems I: Near Inversion of Generalized Sylvester Matrices1996-12-08Paper
Computation of Numerical Padé–Hermite and Simultaneous Padé Systems II: A Weakly Stable Algorithm1996-12-08Paper
https://portal.mardi4nfdi.de/entity/Q48647051996-02-20Paper
Inversion of mosaic Hankel matrices via matrix polynomial systems1995-11-14Paper
https://portal.mardi4nfdi.de/entity/Q43126581995-04-18Paper
A Uniform Approach for the Fast Computation of Matrix-Type Padé Approximants1995-01-22Paper
https://portal.mardi4nfdi.de/entity/Q43103661994-10-26Paper
Inversion of Toeplitz structured matrices using only standard equations1994-09-26Paper
A uniform approach for Hermite Padé and simultaneous Padé approximants and their matrix-type generalizations1994-05-30Paper
Inversion components of block Hankel-like matrices1993-05-16Paper
https://portal.mardi4nfdi.de/entity/Q40236761993-01-23Paper
On the theory and computation of nonperfect Padé-Hermite approximants1993-01-16Paper
Inversion of Toeplitz matrices with only two standard equations1993-01-16Paper
A superfast algorithm for multi-dimensional Padé systems1992-09-27Paper
The Inverses of Block Hankel and Block Toeplitz Matrices1990-01-01Paper
Matrix Padé Fractions and Their Computation1989-01-01Paper

Research outcomes over time

This page was built for person: George Labahn