This shows you the differences between two versions of the page.
Both sides previous revision Previous revision Next revision | Previous revision | ||
tutorial_lud [2018/06/19 15:41] sanjay |
tutorial_lud [2019/04/05 09:02] (current) sanjay |
||
---|---|---|---|
Line 1: | Line 1: | ||
- | In this tutorial, we write an Alphabets (or Alpha, for now the two are synonymous) program, starting from a mathematical equation for LU decomposition. | + | In this tutorial, we write an Alphabets (or Alpha, for now the two are synonymous) program, starting from a mathematical equation for LU decomposition. |
The equation for LU Decomposition, | The equation for LU Decomposition, | ||
Line 18: | Line 18: | ||
- | [Temp note due to : in the last case of L, the condition is "1 < j <= i"] | + | =====Writing |
- | + | ||
- | =====Writing | + | |
====Step 1 : Affine System and Parameters ==== | ====Step 1 : Affine System and Parameters ==== | ||
- | Let's start from an empty alphabets | + | Let's start from an empty alpha file, with LUD as the name of the system, and a positive integer N as its parameter. |
- | A system (Affine System) takes its name from system of affine recurrence equations, and represents a block of computation. An Alphabets | + | A system (Affine System) takes its name from system of affine recurrence equations, and represents a block of computation. An Alpha program may contain multiple systems. |
**Caveat: | **Caveat: |