Verified computation of a disc containing exactly k roots of a univariate nonlinear function

スポンサーリンク

概要

• 論文の詳細を見る

• It is well known that it is an ill-posed problem to decide whether a function has a multiple root. For example, an arbitrarily small perturbation of a real polynomial may change a double real root into two distinct real or complex roots. In this paper we describe a computational method for the verified computation of a complex disc to contain exactly k roots of a univariate nonlinear function. The function may be given by some program. Computational results using INTLAB, the Matlab toolbox for reliable computing, demonstrate properties and limits of the method.

著者

• Rump Siegfried

  Institute For Reliable Computing Hamburg University Of Technology

関連論文

• 行列式の精度保証付き数値計算法
• 大規模疎行列の正定値性の保証法 (計算科学の基盤技術としての高速アルゴリズムとその周辺)
• On the generation of very ill-conditioned integer matrices
• A model problem for global optimization
• Iterative Refinement for Ill-Conditioned Linear Systems
• Adaptive and Efficient Algorithm for 2D Orientation Problem
• Inversion of Extremely Ill-Conditioned Matrices in Floating-Point
• Fast high precision summation
• Verified computation of a disc containing exactly k roots of a univariate nonlinear function

スポンサーリンク