Vous êtes sur la page 1sur 24

# NUMARICA

## SOLUCIAN PARA MOD

Delft University of Technology

Maarten Abbink
17 de junio de 2015

## Maarten Abbink (TU Delft) Beamer Sample 17 de junio de 2015 1 / 16

Outline

1 First Section
Section 1 - Subsection 1
Section 1 - Subsection 2
Section 1 - Subsection 3

2 Second Section
Section 2 - Subsection 1
Section 2 - Last Subsection

## Maarten Abbink (TU Delft) Beamer Sample 17 de junio de 2015 2 / 16

Next Subsection

1 First Section
Section 1 - Subsection 1
Section 1 - Subsection 2
Section 1 - Subsection 3

2 Second Section
Section 2 - Subsection 1
Section 2 - Last Subsection

## Maarten Abbink (TU Delft) Beamer Sample 17 de junio de 2015 3 / 16

Section 1 - Subsection 1 - Page 1

Example
u(n) 6
5
4
3
u(n) = [3, 1, 4]n
2
1
0
0 1 2 3 4 5 6 7 8
n

## Maarten Abbink (TU Delft) Beamer Sample 17 de junio de 2015 4 / 16

Section 1 - Subsection 1 - Page 2

Definition
Let n be a discrete variable, i.e. n . A 1-dimensional periodic number
is a function that depends periodically on n.

u0 if n 0 (mod d)

u1 if n 1 (mod d)
u(n) = [u0 , u1 , . . . , ud1 ]n = .

..

ud1 if n d 1 (mod d)

## Maarten Abbink (TU Delft) Beamer Sample 17 de junio de 2015 5 / 16

Section 1 - Subsection 1 - Page 3
Example
 
21 , 13 n n2 + 3n [1, 2]n
f (n) = (
13 n2 + 3n 2 if n 0 (mod 2)
=
12 n2 + 3n 1 if n 1 (mod 2)

5 31 n2 + 3n 2

4
n2 + 3n [1, 2]n

1
2 3 n
i
1 1
,

0
h
f (n) =

0 1 2 3 4 5 6 7
n
1
12 n2 + 3n 1
2

## Maarten Abbink (TU Delft) Beamer Sample 17 de junio de 2015 6 / 16

Section 1 - Subsection 1 - Page 4
Definition
A polynomial in a variable x is a linear combination of powers of x:
g
X
f (x) = ci x i
i=0

## Maarten Abbink (TU Delft) Beamer Sample 17 de junio de 2015 7 / 16

Section 1 - Subsection 1 - Page 4
Definition
A polynomial in a variable x is a linear combination of powers of x:
g
X
f (x) = ci x i
i=0

Definition
A quasi-polynomial in a variable x is a polynomial expression with
periodic numbers as coefficients:
g
X
f (n) = ui (n)ni
i=0

## Maarten Abbink (TU Delft) Beamer Sample 17 de junio de 2015 7 / 16

Next Subsection

1 First Section
Section 1 - Subsection 1
Section 1 - Subsection 2
Section 1 - Subsection 3

2 Second Section
Section 2 - Subsection 1
Section 2 - Last Subsection

## Maarten Abbink (TU Delft) Beamer Sample 17 de junio de 2015 8 / 16

Section 1 - Subsection 2 - Page 1
Example
7
6
5
y 4 p f (p)
3 3 5
2
1
0
0 1 2 3 4 5 6 7
x
p =3
x +y p

## Maarten Abbink (TU Delft) Beamer Sample 17 de junio de 2015 9 / 16

Section 1 - Subsection 2 - Page 1
Example
7
6
5
y 4 p f (p)
3 3 5
2 4 8
1
0
0 1 2 3 4 5 6 7
x
p =4
x +y p

## Maarten Abbink (TU Delft) Beamer Sample 17 de junio de 2015 9 / 16

Section 1 - Subsection 2 - Page 1
Example
7
6
5
y 4 p f (p)
3 3 5
2 4 8
1 5 10
0
0 1 2 3 4 5 6 7
x
p =5
x +y p

## Maarten Abbink (TU Delft) Beamer Sample 17 de junio de 2015 9 / 16

Section 1 - Subsection 2 - Page 1
Example
7
6
5
y 4 p f (p)
3 3 5
2 4 8
1 5 10
0 6 13
0 1 2 3 4 5 6 7
x
p =6
x +y p

## Maarten Abbink (TU Delft) Beamer Sample 17 de junio de 2015 9 / 16

Section 1 - Subsection 2 - Page 1
Example
7
6
5
y 4 p f (p)
3 3 5  
2 4 8 5 5
p + 2,
1 5 10 2 2 p
0 6 13
0 1 2 3 4 5 6 7
x
p =6
x +y p

## Maarten Abbink (TU Delft) Beamer Sample 17 de junio de 2015 9 / 16

Section 1 - Subsection 2 - Page 2

## The number of integer points in a parametric polytope Pp of

dimension n is expressed as a piecewise a quasi-polynomial of
degree n in p (Clauss and Loechner).

## Maarten Abbink (TU Delft) Beamer Sample 17 de junio de 2015 10 / 16

Section 1 - Subsection 2 - Page 2

## The number of integer points in a parametric polytope Pp of

dimension n is expressed as a piecewise a quasi-polynomial of
degree n in p (Clauss and Loechner).
More general polyhedral counting problems:
Systems of linear inequalities combined with , , , , or
(Presburger formulas).

## Maarten Abbink (TU Delft) Beamer Sample 17 de junio de 2015 10 / 16

Section 1 - Subsection 2 - Page 2

## The number of integer points in a parametric polytope Pp of

dimension n is expressed as a piecewise a quasi-polynomial of
degree n in p (Clauss and Loechner).
More general polyhedral counting problems:
Systems of linear inequalities combined with , , , , or
(Presburger formulas).
Many problems in static program analysis can be expressed as
polyhedral counting problems.

## Maarten Abbink (TU Delft) Beamer Sample 17 de junio de 2015 10 / 16

Next Subsection

1 First Section
Section 1 - Subsection 1
Section 1 - Subsection 2
Section 1 - Subsection 3

2 Second Section
Section 2 - Subsection 1
Section 2 - Last Subsection

## Maarten Abbink (TU Delft) Beamer Sample 17 de junio de 2015 11 / 16

Section 1 - Subsection 3 - Page 1
A picture made with the package TiKz
Example

## Maarten Abbink (TU Delft) Beamer Sample 17 de junio de 2015 12 / 16

Next Subsection

1 First Section
Section 1 - Subsection 1
Section 1 - Subsection 2
Section 1 - Subsection 3

2 Second Section
Section 2 - Subsection 1
Section 2 - Last Subsection

## Maarten Abbink (TU Delft) Beamer Sample 17 de junio de 2015 13 / 16

Section 2 - subsection 1 - page 1

in an .Examplewindow:

Example
Discrete domain evaluate in each point
Not possible for
1 parametric domains

## Maarten Abbink (TU Delft) Beamer Sample 17 de junio de 2015 14 / 16

Section 2 - subsection 1 - page 1

in an .Examplewindow:

Example
Discrete domain evaluate in each point
Not possible for
1 parametric domains
2 large domains (NP-complete)

## Maarten Abbink (TU Delft) Beamer Sample 17 de junio de 2015 14 / 16

Next Subsection

1 First Section
Section 1 - Subsection 1
Section 1 - Subsection 2
Section 1 - Subsection 3

2 Second Section
Section 2 - Subsection 1
Section 2 - Last Subsection

## Maarten Abbink (TU Delft) Beamer Sample 17 de junio de 2015 15 / 16

Last Page

Summary
End of the beamer demo
with a tidy TU Delft lay-out.
Thank you!