SIAM Journal on Numerical Analysis
Fundamentals of matrix computations
Fundamentals of matrix computations
Approximate GCD and its application to ill-conditioned algebraic equations
ISCM '90 Proceedings of the International Symposium on Computation mathematics
Three-dimensional computer vision: a geometric viewpoint
Three-dimensional computer vision: a geometric viewpoint
The singular value decomposition for polynomial systems
ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
Total Least Norm Formulation and Solution for Structured Problems
SIAM Journal on Matrix Analysis and Applications
Approximate polynomial greatest common divisors and nearest singular polynomials
ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
Analysis of zero clusters in multivariate polynomial systems
ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
Common factor detection and estimation
Automatica (Journal of IFAC)
Detection and validation of clusters of polynomial zeros
Journal of Symbolic Computation - Special issue: validated numerical methods and computer algebra
Structured Total Least Norm for Nonlinear Problems
SIAM Journal on Matrix Analysis and Applications
Algebraic Geometry and Computer Vision: Polynomial Systems, Real andComplex Roots
Journal of Mathematical Imaging and Vision
Ray tracing parametric patches
SIGGRAPH '82 Proceedings of the 9th annual conference on Computer graphics and interactive techniques
A composite algorithm for finding zeros of real polynomials
A composite algorithm for finding zeros of real polynomials
Solving Polynomials with Small Leading Coefficients
SIAM Journal on Matrix Analysis and Applications
Structured matrix-based methods for polynomial ∈-gcd: analysis and comparisons
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Structured total least norm and approximate GCDs of inexact polynomials
Journal of Computational and Applied Mathematics
Survey paper: Structured low-rank approximation and its applications
Automatica (Journal of IFAC)
The ERES method for computing the approximate GCD of several polynomials
Applied Numerical Mathematics
Journal of Computational and Applied Mathematics
The calculation of the degree of an approximate greatest common divisor of two polynomials
Journal of Computational and Applied Mathematics
IEEE Transactions on Signal Processing
QR factoring to compute the GCD of univariate approximate polynomials
IEEE Transactions on Signal Processing
Hi-index | 7.29 |
This paper reports on improvements to recent work on the computation of a structured low rank approximation of the Sylvester resultant matrix S(f,g) of two inexact polynomials f=f(y) and g=g(y). Specifically, it has been shown in previous work that these polynomials must be processed before a structured low rank approximation of S(f,g) is computed. The existing algorithm may still, however, yield a structured low rank approximation of S(f,g), but not a structured low rank approximation of S(g,f), which is unsatisfactory. Moreover, a structured low rank approximation of S(f,g) must be equal to, apart from permutations of its columns, a structured low rank approximation of S(g,f), but the existing algorithm does not guarantee the satisfaction of this condition. This paper addresses these issues by modifying the existing algorithm, such that these deficiencies are overcome. Examples that illustrate these improvements are shown.