Topics in matrix analysis
On the numerical condition of polynomials in Berstein form
Computer Aided Geometric Design
Partial singular value decomposition algorithm (Algorithm 32)
Journal of Computational and Applied Mathematics
Algorithms for intersecting parametric and algebraic curves II: multiple intersections
Graphical Models and Image Processing
Displacement structure: theory and applications
SIAM Review
A polynomial approach to linear algebra
A polynomial approach to linear algebra
Applied numerical linear algebra
Applied numerical linear algebra
Spectral methods in MatLab
Structured Pseudospectra for Polynomial Eigenvalue Problems, with Applications
SIAM Journal on Matrix Analysis and Applications
Numerical parameterization of affine varieties using
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Theoretical Computer Science - Algebraic and numerical algorithm
A fast singular value algorithm for Hankel matrices
Contemporary mathematics
Companion matrix pencils for hermite interpolants
Proceedings of the 2007 international workshop on Symbolic-numeric computation
New algorithms for matrices, polynomials and matrix polynomials
New algorithms for matrices, polynomials and matrix polynomials
Curve/surface intersection problem by means of matrix representations
Proceedings of the 2009 conference on Symbolic numeric computation
Matrix representations for toric parametrizations
Computer Aided Geometric Design
Matrix-based implicit representations of rational algebraic curves and applications
Computer Aided Geometric Design
Computer Aided Geometric Design
Hi-index | 0.00 |
Using a new formulation of the Bézout matrix, we construct bivariate matrix polynomials expressed in a tensor-product Lagrange basis. We use these matrix polynomials to solve common tasks in computer-aided geometric design. For example, we show that these bivariate polynomials can serve as stable and efficient implicit representations of plane curves for a variety of curve intersection problems.