Using weighted norms to find nearest polynomials satisfying linear constraints

DOI10.1145/2331684.2331697zbMATH Open1346.68300OpenAlexW2034903850MaRDI QIDQ2819620FDOQ2819620

Authors: Nargol Rezvani, Robert M. Corless 

Publication date: 29 September 2016

Published in: Proceedings of the 2011 International Workshop on Symbolic-Numeric Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2331684.2331697

Recommendations

• Finding polynomials of best approximation with weight
• The nearest polynomial with a given zero, revisited
• A note on a nearest polynomial with a given root
• Varying norms and constraints
• Publication:3468056

zbMATH Keywords

Lagrange basisnearest polynomialHermite interpolational basis

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Numerical interpolation (65D05) Polynomials in real and complex fields: factorization (12D05) Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10)

Cited In (1)

• A unified approach to computing the nearest complex polynomial with a given zero

This page was built for publication: Using weighted norms to find nearest polynomials satisfying linear constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2819620)