Marc Van Barel

Orcid: 0000-0002-7372-382X

Affiliations:
  • Catholic University of Leuven, Belgium


According to our database1, Marc Van Barel authored at least 91 papers between 1991 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A generalization of Floater-Hormann interpolants.
J. Comput. Appl. Math., May, 2024

Rational QZ steps with perfect shifts.
Numer. Algorithms, March, 2024

A Riemannian rank-adaptive method for higher-order tensor completion in the tensor-train format.
CoRR, 2024

2023
Adaptive cross approximation for Tikhonov regularization in general form.
Numer. Algorithms, January, 2023

Stability Improvements for Fast Matrix Multiplication.
CoRR, 2023

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

An Approximate Projection onto the Tangent Cone to the Variety of Third-Order Tensors of Bounded Tensor-Train Rank.
Proceedings of the Geometric Science of Information - 6th International Conference, 2023

Rank Estimation for Third-Order Tensor Completion in the Tensor-Train Format.
Proceedings of the 31st European Signal Processing Conference, 2023

2022
Generation of orthogonal rational functions by procedures for structured matrices.
Numer. Algorithms, 2022

Equivalent polyadic decompositions of matrix multiplication tensors.
J. Comput. Appl. Math., 2022

2021
Backward error measures for roots of polynomials.
Numer. Algorithms, 2021

Truncated normal forms for solving polynomial systems: Generalized and efficient algorithms.
J. Symb. Comput., 2021

2020
A Robust Numerical Path Tracking Algorithm for Polynomial Homotopy Continuation.
SIAM J. Sci. Comput., 2020

Min-Max Elementwise Backward Error for Roots of Polynomials and a Corresponding Backward Stable Root Finder.
CoRR, 2020

Robust Numerical Tracking of One Path of a Polynomial Homotopy on Parallel Shared Memory Computers.
Proceedings of the Computer Algebra in Scientific Computing - 22nd International Workshop, 2020

2019
Uniform approximation on the sphere by least squares polynomials.
Numer. Algorithms, 2019

2018
Solving Polynomial Systems via Truncated Normal Forms.
SIAM J. Matrix Anal. Appl., 2018

A stabilized normal form algorithm for generic systems of polynomial equations.
J. Comput. Appl. Math., 2018

Solving Polynomial Systems Efficiently and Accurately.
CoRR, 2018

Truncated normal forms for solving polynomial systems.
ACM Commun. Comput. Algebra, 2018

2017
Nonnegative Matrix Factorization Using Nonnegative Polynomial Approximations.
IEEE Signal Process. Lett., 2017

Generalized de la Vallée Poussin approximations on [-1, 1].
Numer. Algorithms, 2017

2016
Löwner-Based Blind Signal Separation of Rational Functions With Applications.
IEEE Trans. Signal Process., 2016

Backward Error Analysis of Polynomial Eigenvalue Problems Solved by Linearization.
SIAM J. Matrix Anal. Appl., 2016

Efficient evolutionary spectral clustering.
Pattern Recognit. Lett., 2016

Adaptive cross approximation for ill-posed problems.
J. Comput. Appl. Math., 2016

A convex optimization model for finding non-negative polynomials.
J. Comput. Appl. Math., 2016

Nonlinear eigenvalue problems and contour integrals.
J. Comput. Appl. Math., 2016

Entropy-Based Incomplete Cholesky Decomposition for a Scalable Spectral Clustering Algorithm: Computational Studies and Sensitivity Analysis.
Entropy, 2016

Exact line and plane search for tensor optimization.
Comput. Optim. Appl., 2016

2015
An algorithm for decomposing a non-negative polynomial as a sum of squares of rational functions.
Numer. Algorithms, 2015

Structured Data Fusion.
IEEE J. Sel. Top. Signal Process., 2015

Blind signal separation of rational functions using Löwner-based tensorization.
Proceedings of the 2015 IEEE International Conference on Acoustics, 2015

2014
Numerical Solution of Bivariate and Polyanalytic Polynomial Systems.
SIAM J. Numer. Anal., 2014

Inverse eigenvalue problems for extended Hessenberg and extended tridiagonal matrices.
J. Comput. Appl. Math., 2014

A convex optimization method to solve a filter design problem.
J. Comput. Appl. Math., 2014

Algorithms for the Geronimus transformation for orthogonal polynomials on the unit circle.
J. Comput. Appl. Math., 2014

Introduction to the special issue.
J. Comput. Appl. Math., 2014

2013
Optimization-Based Algorithms for Tensor Decompositions: Canonical Polyadic Decomposition, Decomposition in Rank-(L<sub>r, L<sub>r, 1)</sub></sub> Terms, and a New Generalization.
SIAM J. Optim., 2013

An algorithm for computing the eigenvalues of block companion matrices.
Numer. Algorithms, 2013

Sparse spectral clustering method based on the incomplete Cholesky decomposition.
J. Comput. Appl. Math., 2013

2012
Unconstrained Optimization of Real Functions in Complex Variables.
SIAM J. Optim., 2012

When is the Uvarov transformation positive definite?
Numer. Algorithms, 2012

2010
Implicit double shift <i>QR</i>-algorithm for companion matrices.
Numerische Mathematik, 2010

A method to compute recurrence relation coefficients for bivariate orthogonal polynomials by unitary matrix transformations.
Numer. Algorithms, 2010

A multiple shift QR-step for structured rank matrices.
J. Comput. Appl. Math., 2010

Solving a large dense linear system by adaptive cross approximation.
J. Comput. Appl. Math., 2010

A numerical solution of the constrained weighted energy problem.
J. Comput. Appl. Math., 2010

A direct method to solve block banded block Toeplitz systems with non-banded Toeplitz blocks.
J. Comput. Appl. Math., 2010

Orthogonal Rational Functions with real coefficients and semiseparable matrices.
J. Comput. Appl. Math., 2010

Using semiseparable matrices to compute the SVD of a general matrix product/quotient.
J. Comput. Appl. Math., 2010

Dedication to William B. Gragg on the Occasion of his 70th Birthday.
J. Comput. Appl. Math., 2010

2009
A Quasi-Separable Approach to Solve the Symmetric Definite Tridiagonal Generalized Eigenvalue Problem.
SIAM J. Matrix Anal. Appl., 2009

2008
Computing a Lower Bound of the Smallest Eigenvalue of a Symmetric Positive-Definite Toeplitz Matrix.
IEEE Trans. Inf. Theory, 2008

A QR-Based Solver for Rank Structured Matrices.
SIAM J. Matrix Anal. Appl., 2008

Rational <i>QR</i>-iteration without inversion.
Numerische Mathematik, 2008

A fast algorithm for computing the smallest eigenvalue of a symmetric positive-definite Toeplitz matrix.
Numer. Linear Algebra Appl., 2008

2007
A Givens-Weight Representation for Rank Structured Matrices.
SIAM J. Matrix Anal. Appl., 2007

A Hessenberg Reduction Algorithm for Rank Structured Matrices.
SIAM J. Matrix Anal. Appl., 2007

2006
Structures Preserved by Schur Complementation.
SIAM J. Matrix Anal. Appl., 2006

Structures preserved by matrix inversion.
SIAM J. Matrix Anal. Appl., 2006

On the convergence properties of the orthogonal similarity transformations to tridiagonal and semiseparable (plus diagonal) form.
Numerische Mathematik, 2006

Orthogonal similarity transformation of a symmetric matrix into a diagonal-plus-semiseparable one with free choice of the diagonal.
Numerische Mathematik, 2006

A small note on the scaling of symmetric positive definite semiseparable matrices.
Numer. Algorithms, 2006

2005
Numerically robust transfer function modeling from noisy frequency domain data.
IEEE Trans. Autom. Control., 2005

Convergence of the Isometric Arnoldi Process.
SIAM J. Matrix Anal. Appl., 2005

An Orthogonal Similarity Reduction of a Matrix into Semiseparable Form.
SIAM J. Matrix Anal. Appl., 2005

Orthogonal Rational Functions and Structured Matrices.
SIAM J. Matrix Anal. Appl., 2005

Orthonormal rational function vectors.
Numerische Mathematik, 2005

A note on the representation and definition of semiseparable matrices.
Numer. Linear Algebra Appl., 2005

An implicit <i>QR</i> algorithm for symmetric semiseparable matrices.
Numer. Linear Algebra Appl., 2005

A superfast solver for real symmetric Toeplitz systems using real trigonometric transformations.
Numer. Linear Algebra Appl., 2005

Orthogonal similarity transformation into block-semiseparable matrices of semiseparability rank <i>k</i>.
Numer. Linear Algebra Appl., 2005

Divide and conquer algorithms for computing the eigendecomposition of symmetric diagonal-plus-semiseparable matrices.
Numer. Algorithms, 2005

A note on the recursive calculation of dominant singular subspaces.
Numer. Algorithms, 2005

2004
Iterative inversion of structured matrices.
Theor. Comput. Sci., 2004

A <i>QR</i>-method for computing the singular values via semiseparable matrices.
Numerische Mathematik, 2004

Newton-Like Iteration Based on a Cubic Polynomial for Structured Matrices.
Numer. Algorithms, 2004

On Computing the Spectral Decomposition of Symmetric Arrowhead Matrices.
Proceedings of the Computational Science and Its Applications, 2004

2003
Solving Toeplitz Least Squares Problems by Means of Newton's Iteration.
Numer. Algorithms, 2003

Error Analysis of a Derivative-Free Algorithm for Computing Zeros of Holomorphic Functions.
Computing, 2003

2001
A Stabilized Superfast Solver for Nonsymmetric Toeplitz Systems.
SIAM J. Matrix Anal. Appl., 2001

Robust rational approximation for identification.
Proceedings of the 40th IEEE Conference on Decision and Control, 2001

2000
Coupled Vandermonde matrices and the superfast computation of Toeplitz determinants.
Numer. Algorithms, 2000

An Algorithm Based on Orthogonal Polynominal Vectors for Toeplitz Least Squares Problems.
Proceedings of the Numerical Analysis and Its Applications, 2000

1999
A Derivative-Free Algorithm for Computing Zeros of Analytic Functions.
Computing, 1999

On the Generically Superfast Computation of Hankel Determinants.
Proceedings of the Large-Scale Scientific Computation for Engineering and Environmental Problems, 1999

1995
Vector Orthogonal Polynomials and Least Squares Approximation.
SIAM J. Matrix Anal. Appl., 1995

Formal orthogonal polynomials and Hankel/Toeplitz duality.
Numer. Algorithms, 1995

1992
A general module theoretic framework for vector M-Padé and matrix rational interpolation.
Numer. Algorithms, 1992

1991
The computation of non-perfect Padé-Hermite approximants.
Numer. Algorithms, 1991


  Loading...