default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarc Van Barel
Person information
- affiliation: Catholic University of Leuven, Belgium
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j79]Woula Themistoclakis, Marc Van Barel
:
A new kernel method for the uniform approximation in reproducing kernel Hilbert spaces. Appl. Math. Lett. 153: 109052 (2024)- [j78]Woula Themistoclakis, Marc Van Barel:
A generalization of Floater-Hormann interpolants. J. Comput. Appl. Math. 441: 115683 (2024) - [j77]Nicola Mastronardi, Marc Van Barel, Raf Vandebril, Paul Van Dooren:
Rational QZ steps with perfect shifts. Numer. Algorithms 95(3): 1079-1102 (2024) - [i16]Charlotte Vermeylen, Marc Van Barel:
A Riemannian rank-adaptive method for higher-order tensor completion in the tensor-train format. CoRR abs/2402.12182 (2024) - [i15]Charlotte Vermeylen, Marc Van Barel:
Generalized cyclic symmetric decompositions for the matrix multiplication tensor. CoRR abs/2404.16699 (2024) - [i14]Amin Faghih, Marc Van Barel, Niel Van Buggenhout, Raf Vandebril:
An Arnoldi-based approach to polynomial and rational least squares problems. CoRR abs/2407.05945 (2024) - 2023
- [j76]Thomas Mach, Lothar Reichel, Marc Van Barel:
Adaptive cross approximation for Tikhonov regularization in general form. Numer. Algorithms 92(1): 815-830 (2023) - [c8]Charlotte Vermeylen, Guillaume Olikier, Pierre-Antoine Absil, Marc Van Barel:
Rank Estimation for Third-Order Tensor Completion in the Tensor-Train Format. EUSIPCO 2023: 965-969 - [c7]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. GSI (1) 2023: 484-493 - [i13]Marc Van Barel, Niel Van Buggenhout, Raf Vandebril:
Algorithms for Modifying Recurrence Relations of Orthogonal Polynomial and Rational Functions when Changing the Discrete Inner Product. CoRR abs/2302.00355 (2023) - [i12]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. CoRR abs/2306.13360 (2023) - [i11]Woula Themistoclakis, Marc Van Barel:
A generalization of Floater-Hormann interpolants. CoRR abs/2307.05345 (2023) - [i10]Charlotte Vermeylen, Marc Van Barel:
Stability Improvements for Fast Matrix Multiplication. CoRR abs/2310.02794 (2023) - 2022
- [j75]Guillaume O. Berger, Pierre-Antoine Absil, Lieven De Lathauwer, Raphaël M. Jungers, Marc Van Barel:
Equivalent polyadic decompositions of matrix multiplication tensors. J. Comput. Appl. Math. 406: 113941 (2022) - [j74]Niel Van Buggenhout, Marc Van Barel, Raf Vandebril:
Generation of orthogonal rational functions by procedures for structured matrices. Numer. Algorithms 89(2): 551-582 (2022) - [i9]Thomas Mach, Lothar Reichel, Marc Van Barel:
Adaptive cross approximation for Tikhonov regularization in general form. CoRR abs/2204.05740 (2022) - 2021
- [j73]Bernard Mourrain, Simon Telen, Marc Van Barel:
Truncated normal forms for solving polynomial systems: Generalized and efficient algorithms. J. Symb. Comput. 102: 63-85 (2021) - [j72]Simon Telen, Sascha Timme, Marc Van Barel:
Backward error measures for roots of polynomials. Numer. Algorithms 87(1): 19-39 (2021) - [i8]Niel Van Buggenhout, Marc Van Barel, Raf Vandebril:
Generation of orthogonal rational functions by procedures for structured matrices. CoRR abs/2103.04788 (2021) - 2020
- [j71]Simon Telen, Marc Van Barel, Jan Verschelde:
A Robust Numerical Path Tracking Algorithm for Polynomial Homotopy Continuation. SIAM J. Sci. Comput. 42(6): A3610-A3637 (2020) - [c6]Simon Telen, Marc Van Barel, Jan Verschelde:
Robust Numerical Tracking of One Path of a Polynomial Homotopy on Parallel Shared Memory Computers. CASC 2020: 563-582 - [i7]Françoise Tisseur, Marc Van Barel:
Min-Max Elementwise Backward Error for Roots of Polynomials and a Corresponding Backward Stable Root Finder. CoRR abs/2001.05281 (2020) - [i6]Simon Telen, Marc Van Barel, Jan Verschelde:
Robust Numerical Tracking of One Path of a Polynomial Homotopy on Parallel Shared Memory Computers. CoRR abs/2002.09504 (2020) - [i5]Simon Telen, Sascha Timme, Marc Van Barel:
Backward Error Measures for Roots of Polynomials. CoRR abs/2003.09618 (2020)
2010 – 2019
- 2019
- [j70]Woula Themistoclakis, Marc Van Barel:
Uniform approximation on the sphere by least squares polynomials. Numer. Algorithms 81(3): 1089-1111 (2019) - [i4]Guillaume O. Berger, Pierre-Antoine Absil, Lieven De Lathauwer, Raphaël M. Jungers, Marc Van Barel:
Equivalent Polyadic Decompositions of Matrix Multiplication Tensors. CoRR abs/1902.03950 (2019) - [i3]Simon Telen, Marc Van Barel, Jan Verschelde:
A Robust Numerical Path Tracking Algorithm for Polynomial Homotopy Continuation. CoRR abs/1909.04984 (2019) - 2018
- [j69]Simon Telen, Bernard Mourrain, Marc Van Barel:
Truncated normal forms for solving polynomial systems. ACM Commun. Comput. Algebra 52(3): 78-81 (2018) - [j68]Simon Telen, Marc Van Barel:
A stabilized normal form algorithm for generic systems of polynomial equations. J. Comput. Appl. Math. 342: 119-132 (2018) - [j67]Simon Telen, Bernard Mourrain, Marc Van Barel:
Solving Polynomial Systems via Truncated Normal Forms. SIAM J. Matrix Anal. Appl. 39(3): 1421-1447 (2018) - [i2]Bernard Mourrain, Simon Telen, Marc Van Barel:
Solving Polynomial Systems Efficiently and Accurately. CoRR abs/1803.07974 (2018) - 2017
- [j66]Woula Themistoclakis, Marc Van Barel:
Generalized de la Vallée Poussin approximations on [-1, 1]. Numer. Algorithms 75(1): 1-31 (2017) - [j65]Otto Debals, Marc Van Barel, Lieven De Lathauwer:
Nonnegative Matrix Factorization Using Nonnegative Polynomial Approximations. IEEE Signal Process. Lett. 24(7): 948-952 (2017) - [i1]Simon Telen, Marc Van Barel:
A Stabilized Normal Form Algorithm for Generic Systems of Polynomial Equations. CoRR abs/1708.07670 (2017) - 2016
- [j64]Laurent Sorber, Ignat Domanov, Marc Van Barel, Lieven De Lathauwer:
Exact line and plane search for tensor optimization. Comput. Optim. Appl. 63(1): 121-142 (2016) - [j63]Rocco Langone, Marc Van Barel, Johan A. K. Suykens:
Entropy-Based Incomplete Cholesky Decomposition for a Scalable Spectral Clustering Algorithm: Computational Studies and Sensitivity Analysis. Entropy 18(5): 182 (2016) - [j62]Marc Van Barel, Peter Kravanja:
Nonlinear eigenvalue problems and contour integrals. J. Comput. Appl. Math. 292: 526-540 (2016) - [j61]Thanh Hieu Le, Marc Van Barel:
A convex optimization model for finding non-negative polynomials. J. Comput. Appl. Math. 301: 121-134 (2016) - [j60]Thomas Mach, Lothar Reichel, Marc Van Barel, Raf Vandebril:
Adaptive cross approximation for ill-posed problems. J. Comput. Appl. Math. 303: 206-217 (2016) - [j59]Rocco Langone, Marc Van Barel, Johan A. K. Suykens:
Efficient evolutionary spectral clustering. Pattern Recognit. Lett. 84: 78-84 (2016) - [j58]Piers W. Lawrence, Marc Van Barel, Paul Van Dooren:
Backward Error Analysis of Polynomial Eigenvalue Problems Solved by Linearization. SIAM J. Matrix Anal. Appl. 37(1): 123-144 (2016) - [j57]Otto Debals, Marc Van Barel, Lieven De Lathauwer:
Löwner-Based Blind Signal Separation of Rational Functions With Applications. IEEE Trans. Signal Process. 64(8): 1909-1918 (2016) - 2015
- [j56]Laurent Sorber, Marc Van Barel, Lieven De Lathauwer:
Structured Data Fusion. IEEE J. Sel. Top. Signal Process. 9(4): 586-600 (2015) - [j55]Thanh Hieu Le, Marc Van Barel:
An algorithm for decomposing a non-negative polynomial as a sum of squares of rational functions. Numer. Algorithms 69(2): 397-413 (2015) - [c5]Otto Debals, Marc Van Barel, Lieven De Lathauwer:
Blind signal separation of rational functions using Löwner-based tensorization. ICASSP 2015: 4145-4149 - 2014
- [j54]Thanh Hieu Le, Marc Van Barel:
A convex optimization method to solve a filter design problem. J. Comput. Appl. Math. 255: 183-192 (2014) - [j53]Matthias Humet, Marc Van Barel:
Algorithms for the Geronimus transformation for orthogonal polynomials on the unit circle. J. Comput. Appl. Math. 267: 195-217 (2014) - [j52]Dario A. Bini, Lieven De Lathauwer, Nicola Mastronardi, Marc Van Barel, Raf Vandebril, Paul Van Dooren:
Introduction to the special issue. J. Comput. Appl. Math. 272: 275 (2014) - [j51]Thomas Mach, Marc Van Barel, Raf Vandebril:
Inverse eigenvalue problems for extended Hessenberg and extended tridiagonal matrices. J. Comput. Appl. Math. 272: 377-398 (2014) - [j50]Laurent Sorber, Marc Van Barel, Lieven De Lathauwer:
Numerical Solution of Bivariate and Polyanalytic Polynomial Systems. SIAM J. Numer. Anal. 52(4): 1551-1572 (2014) - 2013
- [j49]Katrijn Frederix, Marc Van Barel:
Sparse spectral clustering method based on the incomplete Cholesky decomposition. J. Comput. Appl. Math. 237(1): 145-161 (2013) - [j48]Katrijn Frederix, Steven Delvaux, Marc Van Barel:
An algorithm for computing the eigenvalues of block companion matrices. Numer. Algorithms 62(2): 261-287 (2013) - [j47]Laurent Sorber, Marc Van Barel, Lieven De Lathauwer:
Optimization-Based Algorithms for Tensor Decompositions: Canonical Polyadic Decomposition, Decomposition in Rank-(Lr, Lr, 1) Terms, and a New Generalization. SIAM J. Optim. 23(2): 695-720 (2013) - 2012
- [j46]Matthias Humet, Marc Van Barel:
When is the Uvarov transformation positive definite? Numer. Algorithms 59(1): 51-62 (2012) - [j45]Laurent Sorber, Marc Van Barel, Lieven De Lathauwer:
Unconstrained Optimization of Real Functions in Complex Variables. SIAM J. Optim. 22(3): 879-898 (2012) - 2010
- [j44]Greg S. Ammar, Lothar Reichel, Marc Van Barel:
Dedication to William B. Gragg on the Occasion of his 70th Birthday. J. Comput. Appl. Math. 233(5): 1191 (2010) - [j43]Adhemar Bultheel, Patrick Van Gucht, Marc Van Barel:
Orthogonal Rational Functions with real coefficients and semiseparable matrices. J. Comput. Appl. Math. 233(5): 1192-1201 (2010) - [j42]Raf Vandebril, Marc Van Barel, Nicola Mastronardi:
A multiple shift QR-step for structured rank matrices. J. Comput. Appl. Math. 233(5): 1326-1344 (2010) - [j41]Andrey Chesnokov, Marc Van Barel:
A direct method to solve block banded block Toeplitz systems with non-banded Toeplitz blocks. J. Comput. Appl. Math. 234(5): 1485-1491 (2010) - [j40]Marc Van Barel, Yvette Vanberghen, Paul Van Dooren:
Using semiseparable matrices to compute the SVD of a general matrix product/quotient. J. Comput. Appl. Math. 234(11): 3175-3180 (2010) - [j39]Katrijn Frederix, Marc Van Barel:
Solving a large dense linear system by adaptive cross approximation. J. Comput. Appl. Math. 234(11): 3181-3195 (2010) - [j38]Andrey Chesnokov, Karl Deckers, Marc Van Barel:
A numerical solution of the constrained weighted energy problem. J. Comput. Appl. Math. 235(4): 950-965 (2010) - [j37]Marc Van Barel, Andrey Chesnokov:
A method to compute recurrence relation coefficients for bivariate orthogonal polynomials by unitary matrix transformations. Numer. Algorithms 55(2-3): 383-402 (2010) - [j36]Marc Van Barel, Raf Vandebril, Paul Van Dooren, Katrijn Frederix:
Implicit double shift QR-algorithm for companion matrices. Numerische Mathematik 116(2): 177-212 (2010)
2000 – 2009
- 2009
- [j35]Raf Vandebril, Gene H. Golub, Marc Van Barel:
A Quasi-Separable Approach to Solve the Symmetric Definite Tridiagonal Generalized Eigenvalue Problem. SIAM J. Matrix Anal. Appl. 31(1): 154-174 (2009) - 2008
- [j34]Nicola Mastronardi, Marc Van Barel, Raf Vandebril:
A fast algorithm for computing the smallest eigenvalue of a symmetric positive-definite Toeplitz matrix. Numer. Linear Algebra Appl. 15(4): 327-337 (2008) - [j33]Raf Vandebril, Marc Van Barel, Nicola Mastronardi:
Rational QR-iteration without inversion. Numerische Mathematik 110(4): 561-575 (2008) - [j32]Steven Delvaux, Marc Van Barel:
A QR-Based Solver for Rank Structured Matrices. SIAM J. Matrix Anal. Appl. 30(2): 464-490 (2008) - [j31]Teresa Laudadio, Nicola Mastronardi, Marc Van Barel:
Computing a Lower Bound of the Smallest Eigenvalue of a Symmetric Positive-Definite Toeplitz Matrix. IEEE Trans. Inf. Theory 54(10): 4726-4731 (2008) - 2007
- [j30]Steven Delvaux, Marc Van Barel:
A Hessenberg Reduction Algorithm for Rank Structured Matrices. SIAM J. Matrix Anal. Appl. 29(3): 895-926 (2007) - [j29]Steven Delvaux, Marc Van Barel:
A Givens-Weight Representation for Rank Structured Matrices. SIAM J. Matrix Anal. Appl. 29(4): 1147-1170 (2007) - 2006
- [j28]Raf Vandebril, Gene H. Golub, Marc Van Barel:
A small note on the scaling of symmetric positive definite semiseparable matrices. Numer. Algorithms 41(3): 319-326 (2006) - [j27]Raf Vandebril, Ellen Van Camp, Marc Van Barel, Nicola Mastronardi:
Orthogonal similarity transformation of a symmetric matrix into a diagonal-plus-semiseparable one with free choice of the diagonal. Numerische Mathematik 102(4): 709-726 (2006) - [j26]Raf Vandebril, Ellen Van Camp, Marc Van Barel, Nicola Mastronardi:
On the convergence properties of the orthogonal similarity transformations to tridiagonal and semiseparable (plus diagonal) form. Numerische Mathematik 104(2): 205-239 (2006) - [j25]Steven Delvaux, Marc Van Barel:
Structures preserved by matrix inversion. SIAM J. Matrix Anal. Appl. 28(1): 213-228 (2006) - [j24]Steven Delvaux, Marc Van Barel:
Structures Preserved by Schur Complementation. SIAM J. Matrix Anal. Appl. 28(1): 229-252 (2006) - 2005
- [j23]Nicola Mastronardi, Marc Van Barel, Raf Vandebril:
A note on the recursive calculation of dominant singular subspaces. Numer. Algorithms 38(4): 237-242 (2005) - [j22]Nicola Mastronardi, Ellen Van Camp, Marc Van Barel:
Divide and conquer algorithms for computing the eigendecomposition of symmetric diagonal-plus-semiseparable matrices. Numer. Algorithms 39(4): 379-398 (2005) - [j21]Raf Vandebril, Marc Van Barel, Nicola Mastronardi:
An implicit QR algorithm for symmetric semiseparable matrices. Numer. Linear Algebra Appl. 12(7): 625-658 (2005) - [j20]Gianni Codevico, Georg Heinig, Marc Van Barel:
A superfast solver for real symmetric Toeplitz systems using real trigonometric transformations. Numer. Linear Algebra Appl. 12(8): 699-713 (2005) - [j19]Raf Vandebril, Marc Van Barel, Nicola Mastronardi:
A note on the representation and definition of semiseparable matrices. Numer. Linear Algebra Appl. 12(8): 839-858 (2005) - [j18]Marc Van Barel, Ellen Van Camp, Nicola Mastronardi:
Orthogonal similarity transformation into block-semiseparable matrices of semiseparability rank k. Numer. Linear Algebra Appl. 12(10): 981-1000 (2005) - [j17]Steven Delvaux, Marc Van Barel:
Orthonormal rational function vectors. Numerische Mathematik 100(3): 409-440 (2005) - [j16]S. Helsen, Arno B. J. Kuijlaars, Marc Van Barel:
Convergence of the Isometric Arnoldi Process. SIAM J. Matrix Anal. Appl. 26(3): 782-809 (2005) - [j15]Marc Van Barel, Dario Fasino, Luca Gemignani, Nicola Mastronardi:
Orthogonal Rational Functions and Structured Matrices. SIAM J. Matrix Anal. Appl. 26(3): 810-829 (2005) - [j14]Marc Van Barel, Raf Vandebril, Nicola Mastronardi:
An Orthogonal Similarity Reduction of a Matrix into Semiseparable Form. SIAM J. Matrix Anal. Appl. 27(1): 176-197 (2005) - [j13]Adhemar Bultheel, Marc Van Barel, Yves Rolain, Rik Pintelon:
Numerically robust transfer function modeling from noisy frequency domain data. IEEE Trans. Autom. Control. 50(11): 1835-1839 (2005) - 2004
- [j12]Gianni Codevico, Victor Y. Pan, Marc Van Barel:
Newton-Like Iteration Based on a Cubic Polynomial for Structured Matrices. Numer. Algorithms 36(4): 365-380 (2004) - [j11]Raf Vandebril, Marc Van Barel, Nicola Mastronardi:
A QR-method for computing the singular values via semiseparable matrices. Numerische Mathematik 99(1): 163-195 (2004) - [j10]Victor Y. Pan, Marc Van Barel, Xinmao Wang, Gianni Codevico:
Iterative inversion of structured matrices. Theor. Comput. Sci. 315(2-3): 581-592 (2004) - [c4]Fasma Diele, Nicola Mastronardi, Marc Van Barel, Ellen Van Camp:
On Computing the Spectral Decomposition of Symmetric Arrowhead Matrices. ICCSA (2) 2004: 932-941 - 2003
- [j9]Peter Kravanja, Tetsuya Sakurai, Marc Van Barel:
Error Analysis of a Derivative-Free Algorithm for Computing Zeros of Holomorphic Functions. Computing 70(4): 335-347 (2003) - [j8]Dario A. Bini, Gianni Codevico, Marc Van Barel:
Solving Toeplitz Least Squares Problems by Means of Newton's Iteration. Numer. Algorithms 33(1-4): 93-103 (2003) - 2001
- [j7]Marc Van Barel, Georg Heinig, Peter Kravanja:
A Stabilized Superfast Solver for Nonsymmetric Toeplitz Systems. SIAM J. Matrix Anal. Appl. 23(2): 494-510 (2001) - [c3]Adhemar Bultheel, Marc Van Barel, Yves Rolain, Johan Schoukens:
Robust rational approximation for identification. CDC 2001: 4770-4775 - 2000
- [j6]Peter Kravanja, Marc Van Barel:
Coupled Vandermonde matrices and the superfast computation of Toeplitz determinants. Numer. Algorithms 24(1-2): 99-116 (2000) - [c2]Marc Van Barel, Georg Heinig, Peter Kravanja:
An Algorithm Based on Orthogonal Polynominal Vectors for Toeplitz Least Squares Problems. NAA 2000: 27-34
1990 – 1999
- 1999
- [j5]Peter Kravanja, Marc Van Barel:
A Derivative-Free Algorithm for Computing Zeros of Analytic Functions. Computing 63(1): 69-91 (1999) - [c1]Marc Van Barel, Peter Kravanja:
On the Generically Superfast Computation of Hankel Determinants. LSSC 1999: 57-64 - 1995
- [j4]Adhemar Bultheel, Marc Van Barel:
Formal orthogonal polynomials and Hankel/Toeplitz duality. Numer. Algorithms 10(2): 289-335 (1995) - [j3]Adhemar Bultheel, Marc Van Barel:
Vector Orthogonal Polynomials and Least Squares Approximation. SIAM J. Matrix Anal. Appl. 16(3): 863-885 (1995) - 1992
- [j2]Marc Van Barel, Adhemar Bultheel:
A general module theoretic framework for vector M-Padé and matrix rational interpolation. Numer. Algorithms 3(1): 451-461 (1992) - 1991
- [j1]Marc Van Barel, Adhemar Bultheel:
The computation of non-perfect Padé-Hermite approximants. Numer. Algorithms 1(2): 285-304 (1991)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:06 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
