Using weighted norms to find nearest polynomials satisfying linear constraints

Authors:
Nargol Rezvani;Robert M. Corless
Affiliations:
University of Toronto, Toronto, Ontario, Canada;University of Western Ontario, London, Ontario, Canada
Venue:
Proceedings of the 2011 International Workshop on Symbolic-Numeric Computation
Year:
2012

Citing 11
Cited 0

Algorithms for polynomials in Bernstein form

Computer Aided Geometric Design
Hermite interpolation: the barycentric approach

Computing - Special issue on archives for informatics and numerical computation
The singular value decomposition for polynomial systems

ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
Efficient algorithms for computing the nearest polynomial with constrained roots

ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
Efficient algorithms for computing the nearest polynomial with a real root and related problems

ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
Spectral methods in MatLab

Spectral methods in MatLab
The nearest polynomial with a given zero, and similar problems

ACM SIGSAM Bulletin
The nearest polynomial with a given zero, revisited

ACM SIGSAM Bulletin
Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials

Proceedings of the 2006 international symposium on Symbolic and algebraic computation
The nearest polynomial of lower degree

Proceedings of the 2007 international workshop on Symbolic-numeric computation
Multi-degree reduction of Bézier curves with constraints, using dual Bernstein basis polynomials

Computer Aided Geometric Design

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper extends earlier results on finding nearest polynomials, expressed in various polynomial bases, satisfying linear constraints. Results are extended to different bases, including Hermite interpolational bases (not to be confused with the Hermite orthogonal polynomials). Results are also extended to the case of weighted norms, which turns out to be slightly nontrivial, and interesting in practice.