ML p(r)ior | Algorithms for Simultaneous Padé Approximations

Algorithms for Simultaneous Padé Approximations

2016-02-02
We describe how to solve simultaneous Pad\'e approximations over a power series ring $K[[x]]$ for a field $K$ using $O~(n^{\omega - 1} d)$ operations in $K$, where $d$ is the sought precision and $n$ is the number of power series to approximate. We develop two algorithms using different approaches. Both algorithms return a reduced sub-bases that generates the complete set of solutions to the input approximations problem that satisfy the given degree constraints. Our results are made possible by recent breakthroughs in fast computations of minimal approximant bases and Hermite Pad\'e approximations.
PDF

Highlights - Most important sentences from the article

Login to like/save this paper, take notes and configure your recommendations

Related Articles

2019-05-13

The dynamic matrix inverse problem is to maintain the inverse of a matrix undergoing element and col… show more
PDF

Highlights - Most important sentences from the article

2019-05-10

Complexity bounds for many problems on matrices with univariate polynomial entries have been improve… show more
PDF

Highlights - Most important sentences from the article

2018-01-14

In this article, we design fast algorithms for the computation of approximant bases in shifted Popov… show more
PDF

Highlights - Most important sentences from the article

2016-10-10
1610.02962 | stat.ML

This work studies the linear approximation of high-dimensional dynamical systems using low-rank dyna… show more
PDF

Highlights - Most important sentences from the article

2018-11-05

Consider the following fundamental learning problem: given input examples $x \in \mathbb{R}^d$ and t… show more
PDF

Highlights - Most important sentences from the article

2018-03-17
1803.06521 | cs.LG

We introduce the problem of learning mixtures of $k$ subcubes over $\{0,1\}^n$, which contains many … show more
PDF

Highlights - Most important sentences from the article

2018-03-21

We consider the problem of finding the isolated common roots of a set of polynomial functions defini… show more
PDF

Highlights - Most important sentences from the article

2018-12-11

We consider the problem of computing the nearest matrix polynomial with a non-trivial Smith Normal F… show more
PDF

Highlights - Most important sentences from the article

2017-12-12

Consider a zero-dimensional ideal $I$ in $\mathbb{K}[X_1,\dots,X_n]$. Inspired by Faug\`ere and Mou'… show more
PDF

Highlights - Most important sentences from the article

2018-04-10

We consider two matrix completion problems, in which we are given a matrix with missing entries and … show more
PDF

Highlights - Most important sentences from the article

2017-01-19

Motivated by applications in cancer genomics and following the work of Hajirasouliha and Raphael (WA… show more
PDF

Highlights - Most important sentences from the article

2017-04-26

We consider relative error low rank approximation of $tensors$ with respect to the Frobenius norm: g… show more
PDF

Highlights - Most important sentences from the article

2016-01-06

In this paper, a polynomial-time algorithm is given to compute the generalized Hermite normal form f… show more
PDF

Highlights - Most important sentences from the article

2012-03-30

We consider the problem of computing the rank of an m x n matrix A over a field. We present a random… show more
PDF

Highlights - Most important sentences from the article

2014-02-10

Matrix Completion is the problem of recovering an unknown real-valued low-rank matrix from a subsamp… show more
PDF

Highlights - Most important sentences from the article

2013-12-27

Structured Low-Rank Approximation is a problem arising in a wide range of applications in Numerical … show more
PDF

Highlights - Most important sentences from the article