activity
20172026
most citedTruncated Normal Forms for Solving Polynomial Systems: Generalized and Efficient Algorithms

12 citations · 19 across the 11 of their papers we have counts for

collaborators
Showing 2023Show all

5 papers · 1 filter

math.NA2023

Stability Improvements for Fast Matrix Multiplication

Charlotte Vermeylen, Marc Van Barel

We implement an Augmented Lagrangian method to minimize a constrained least-squares cost function designed to find polyadic decompositions of the matrix multiplication tensor. We u…

math.OC2023★ 2 cited

Rank Estimation for Third-Order Tensor Completion in the Tensor-Train Format

Charlotte Vermeylen, Guillaume Olikier, P. -A. Absil +1

We propose a numerical method to obtain an adequate value for the upper bound on the rank for the tensor completion problem on the variety of third-order tensors of bounded tensor-…

math.NA2023

A generalization of Floater--Hormann interpolants

Woula Themistoclakis, Marc Van Barel

In this paper the interpolating rational functions introduced by Floater and Hormann are generalized leading to a whole new family of rational functions depending on , an additi…

math.OC2023★ 1 cited

An Approximate Projection onto the Tangent Cone to the Variety of Third-Order Tensors of Bounded Tensor-Train Rank

Charlotte Vermeylen, Guillaume Olikier, Marc Van Barel

An approximate projection onto the tangent cone to the variety of third-order tensors of bounded tensor-train rank is proposed and proven to satisfy a better angle condition than t…

math.NA2023★ 4 cited

Algorithms for Modifying Recurrence Relations of Orthogonal Polynomial and Rational Functions when Changing the Discrete Inner Product

Marc Van Barel, Niel Van Buggenhout, Raf Vandebril

Often, polynomials or rational functions, orthogonal for a particular inner product are desired. In practical numerical algorithms these polynomials are not constructed, but instea…