Workshop: Structured Numerical Linear Algebra Problems: Algorithms and Applications Cortona, Italy, - PowerPoint PPT Presentation

1 / 63
About This Presentation
Title:

Workshop: Structured Numerical Linear Algebra Problems: Algorithms and Applications Cortona, Italy,

Description:

Cortona, Italy, September 19-24, 2004. Interpolation and Approximation on Chebyshev extrema nodes ... of a function at the collocation points can be expressed ... – PowerPoint PPT presentation

Number of Views:96
Avg rating:3.0/5.0
Slides: 64
Provided by: giusepp1
Category:

less

Transcript and Presenter's Notes

Title: Workshop: Structured Numerical Linear Algebra Problems: Algorithms and Applications Cortona, Italy,


1
WorkshopStructured Numerical Linear Algebra
ProblemsAlgorithms and ApplicationsCortona,
Italy, September 19-24, 2004
  • Interpolation and Approximation on Chebyshev
    extrema nodes

Alfredo Eisinberg Giuseppe Fedele DEIS
University of Calabria - Italy
2
Outline
A property on the elementary symmetric functions
Explicit factorization of the inverse of the
Vandermonde matrix
Symmetric functions for G-L nodes
Vandermonde systems on G-L nodes
Discrete orthogonal polynomials on G-L nodes
Applications
3
A property on elementary symmetric functions
4
A property on elementary symmetric functions
Example
5
A property on elementary symmetric functions
Example (continued)
6
A property on elementary symmetric functions
A. Eisinberg, C. Picardi On the inversion of
Vandermonde matrix IFAC, Kyoto, Japan, 1981. A.
Eisinberg, G. Fedele A property on the elementary
symmetric functions Unpublished
7
A property on elementary symmetric functions
8
A property on elementary symmetric functions
Inverse of the Vandermonde matrix
9
A property on elementary symmetric functions
Inverse of the Vandermonde matrix
10
A property on elementary symmetric functions
Inverse of the Vandermonde matrix
11
A property on elementary symmetric functions
Factorization
12
Chebyshev nodes
13
Chebyshev nodes Standard
A. Eisinberg, G. Fedele Polynomial interpolation
and related algorithms Twelfth International
Colloquium on Num. Anal. And Computer Science
with Appl. Plovdiv, 2003.
14
Chebyshev nodes Extended
A. Eisinberg, G. Fedele Polynomial interpolation
and related algorithms Twelfth International
Colloquium on Num. Anal. And Computer Science
with Appl. Plovdiv, 2003.
15
Why Gauss-Lobatto nodes?
L. Brutman, A Note on Polynomial Interpolation
at the Chebyshev Extrema Nodes, Journal of
Approx. Theory 42, 283-292 (1984).
16
Why Gauss-Lobatto nodes?
For some sets of nodes which are of special
importance in the interpolation theory, such as
equidistant nodes, Chebyshev roots and extrema
and others, the behavior of the Lebesgue
function is well investigated.
L. Brutman, Lebesgue functions for polynomial
interpolation a survey, Annals of Numerical
Mathematics 4, 111-127 (1997).
17
Notes Chebyshev nodes
18
Chebyshev nodes
19
Interpolation on Gauss-Lobatto nodes
20
Gauss-Lobatto Chebyshev nodes (extrema)
21
Gauss-Lobatto Chebyshev nodes (extrema)
22
Gauss-Lobatto Chebyshev nodes (extrema)
23
Factorization
24
Factorization
A. Eisinberg, G. Fedele Vandermonde systems on
Gauss-Lobatto Chebyshev nodes Unpublished
25
Properties of Q
26
Properties of H
n9
27
Algorithm details
28
Algorithm details
29
Algorithm details
30
Algorithm details
31
Numerical experiments
Primal system
Dual system
32
Numerical experiments
33
Numerical experiments
34
Computational cost
35
Frobenius norms
36
Frobenius norms
A. Eisinberg, G. Fedele Vandermonde systems on
Gauss-Lobatto Chebyshev nodes Unpublished
37
Determinant
A. Eisinberg, G. Fedele Vandermonde systems on
Gauss-Lobatto Chebyshev nodes Unpublished
38
Discrete orthogonal polynomials on Gauss-Lobatto
nodes
39
Discrete orthogonal polynomials on G-L nodes
40
Discrete orthogonal polynomials on G-L nodes
A. Eisinberg, G. Fedele Discrete orthogonal
polynomials on Gauss-Lobatto Chebyshev
nodes Unpublished
41
Discrete orthogonal polynomials on G-L nodes
42
Discrete orthogonal polynomials on G-L nodes
43
Discrete orthogonal polynomials on G-L nodes
44
(No Transcript)
45
Discrete orthogonal polynomials on G-L nodes
Inner products
Three-terms recurrence relation
46
Numerical results
47
Numerical results
EF Our algorithm 4mn flops
CB Conte De Boor algorithm 10mn
flops
S. D. Conte, C. De Boor Elementary Numerical
Analysis McGraw Hill, 2nd ed., 1972.
48
Numerical results
49
Numerical results
50
Numerical results
51
Applications
52
Eigensystems
53
Eigensystems
A. Eisinberg, G. Fedele A property on the
elementary symmetric functions Unpublished
54
Differentiation matrices
55
The process of obtaining approximations to the
values of a function at the collocation points
can be expressed as a matrix-vector
multiplication the matrices involved are called
spectral differentiation matrices.
56
Differentiation matrices
57
Differentiation matrices
58
Differentiation matrices
B. D. Welfert Generation of pseudospectral
differentiation matrices I SIAM J. Numer. Anal.,
34, 1640-1657 (1997).
59
LMS filter
60
LMS filter
S/N 0.1
61
Unpublished papers
62
Papers
A. Eisinberg, G. Fedele Accurate floating point
summation a new approach A. Eisinberg, G.
Fedele A property on the elementary symmetric
functions. A. Eisinberg, G. Fedele On the
inversion of the Vandermonde matrix. A.
Eisinberg, G. Fedele, C. Imbrogno Vandermonde
systems on equidistant nodes in 0,1. A.
Eisinberg, G. Fedele, G. Franzè On the Lebesgue
constant for Lagrange interpolation on
equidistant nodes. A. Eisinberg, G.
Fedele Discrete orthogonal polynomials on
equidistant nodes. A. Eisinberg, G.
Fedele Vandermonde systems on Gauss-Lobatto
Chebyshev nodes. A. Eisinberg, G.
Fedele Discrete orthogonal polynomials on
Gauss-Lobatto Chebyshev nodes.
63
Tank you
Write a Comment
User Comments (0)
About PowerShow.com