Skip to main content

A Sequence of Nearest Polynomials with Given Factors

  • Conference paper
  • First Online:
Computer Mathematics
  • 696 Accesses

Abstract

Let \(K\) be either \(\mathbb {R}\) or \(\mathbb {C}\), and \(p\) and \(f_0\) be polynomials in \(K[x_1,\ldots ,x_s]\) such that \(p\ne 0\), \(\Vert f_0\Vert =1\), where \(\Vert f_0\Vert \) is the Euclidean norm of \(f_0\), and the coefficient of \(f_0\) with the maximal absolute value is a positive real number. For \(j=1\), \(2\), ..., let \(p_{2j-1}=f_{j-1}g_j\) be the nearest polynomial to \(p\) such that \(f_{j-1}|p_{2j-1}\) and \(\deg (p_{2j-1})\le \deg (p)\), where \(\deg \) is the total degree, and \(p_{2j}=c_j f_j g_j\) be the nearest polynomial to \(p\) such that \(c_j\in K\), \(g_j|p_{2j}\), \(\deg (p_{2j})\le \deg (p)\), \(\Vert f_j\Vert = 1\), and the coefficient of \(f_j\) with the maximal absolute value is a positive real number. We investigate the behavior of the sequences \(\{\,p_j\,\}\), \(\{\,f_j\,\}\), \(\{\,g_j\,\}\), and \(\{\,c_j\,\}\).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Campbell, S.L., Meyer Jr, C.D.: Generalized Inverses of Linear Transformations. Pitman Publishing Ltd, London (1979)

    MATH  Google Scholar 

  2. Kaltofen, E., May, J.P., Yang, Z., Zhi, L.: Approximate factorization of multivariate polynomials using singular value decomposition. J. Symbolic Comput. 43(5), 359–376 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  3. Stetter, H.J.: The nearest polynomial with a given zero, and similar problems. ACM SIGSAM Bull. 33(4), 2–4 (1999)

    Article  MATH  Google Scholar 

  4. von zur Gathen, J., Gerhard, J.: Modern Computer Algebra, 2nd edn. Cambridge University Press, Cambridge (2003)

    MATH  Google Scholar 

Download references

Acknowledgments

This work was supported by the Japan Society for the Promotion of Science through Grant-in-Aids for Scientific Research (KAKENHI) 21500026 and 24500022.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hiroshi Sekigawa .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sekigawa, H. (2014). A Sequence of Nearest Polynomials with Given Factors. In: Feng, R., Lee, Ws., Sato, Y. (eds) Computer Mathematics. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-43799-5_12

Download citation

Publish with us

Policies and ethics