- Library Home /
- Search Collections /
- Open Collections /
- Browse Collections /
- BIRS Workshop Lecture Videos /
- On rational functions without Froissart doublets
Open Collections
BIRS Workshop Lecture Videos
BIRS Workshop Lecture Videos
On rational functions without Froissart doublets Matos, Ana
Description
In this talk we consider the problem of working with rational functions in a numeric environment. A particular problem when modelling with such functions is the existence of Froissart doublets, where a zero is close to a pole. We discuss three different parameters which allow one to monitor the absence of Froissart doublets for a given general rational function. These include the euclidean condition number of an underlying Sylvester-type matrix, a parameter for determining coprimeness of two numerical polynomials and bounds on the spherical derivative. We show that our parameters sharpen those found in previous papers (1) and (2) (1) B. Beckermann and G. Labahn, When are two numerical polynomials relatively prime? {\em Journal of Symbolic Computation} {\bf 26} (1998) 677-689. (2) B. Beckermann and A. Matos, Algebraic properties of robust Pad\'e approximants, {\em Journal of Approximation Theory }{\bf 190} (2015) 91-115. This is joint work with B. Beckermann (Lille) and G. Labahn (Waterloo)
Item Metadata
Title |
On rational functions without Froissart doublets
|
Creator | |
Publisher |
Banff International Research Station for Mathematical Innovation and Discovery
|
Date Issued |
2016-11-03T09:30
|
Description |
In this talk we consider the problem of working with rational functions in a numeric environment. A particular problem when modelling with such functions is the existence of Froissart doublets, where a zero is close to a pole. We discuss three different parameters which allow one to monitor the absence of Froissart doublets for a given general rational function. These include the euclidean condition number of an underlying Sylvester-type matrix, a parameter for determining coprimeness of two numerical polynomials and bounds on the spherical derivative. We show that our parameters sharpen those found in previous papers (1) and (2)
(1) B. Beckermann and G. Labahn, When are two numerical polynomials relatively prime? {\em Journal of Symbolic Computation} {\bf 26} (1998) 677-689.
(2) B. Beckermann and A. Matos, Algebraic properties of robust Pad\'e approximants, {\em Journal of Approximation Theory }{\bf 190} (2015) 91-115.
This is joint work with B. Beckermann (Lille) and G. Labahn (Waterloo)
|
Extent |
49 minutes
|
Subject | |
Type | |
File Format |
video/mp4
|
Language |
eng
|
Notes |
Author affiliation: University of Lille France
|
Series | |
Date Available |
2017-06-06
|
Provider |
Vancouver : University of British Columbia Library
|
Rights |
Attribution-NonCommercial-NoDerivatives 4.0 International
|
DOI |
10.14288/1.0348099
|
URI | |
Affiliation | |
Peer Review Status |
Unreviewed
|
Scholarly Level |
Faculty
|
Rights URI | |
Aggregated Source Repository |
DSpace
|
Item Media
Item Citations and Data
Rights
Attribution-NonCommercial-NoDerivatives 4.0 International