Last change
on this file since 1 was 1, checked in by Marek Rychlik, 15 years ago |
First import of a version circa 1997.
|
File size:
1.2 KB
|
Rev | Line | |
---|
[1] | 1 | head 1.1;
|
---|
| 2 | access;
|
---|
| 3 | symbols;
|
---|
| 4 | locks; strict;
|
---|
| 5 | comment @;;; @;
|
---|
| 6 |
|
---|
| 7 |
|
---|
| 8 | 1.1
|
---|
| 9 | date 2009.01.19.08.51.43; author marek; state Exp;
|
---|
| 10 | branches;
|
---|
| 11 | next ;
|
---|
| 12 |
|
---|
| 13 |
|
---|
| 14 | desc
|
---|
| 15 | @@
|
---|
| 16 |
|
---|
| 17 |
|
---|
| 18 | 1.1
|
---|
| 19 | log
|
---|
| 20 | @Initial revision
|
---|
| 21 | @
|
---|
| 22 | text
|
---|
| 23 | @#|
|
---|
| 24 | $Id: trivial.lisp,v 1.1 1997/12/12 07:24:03 marek Exp marek $
|
---|
| 25 | *--------------------------------------------------------------------------*
|
---|
| 26 | | Copyright (C) 1994, Marek Rychlik (e-mail: rychlik@@math.arizona.edu) |
|
---|
| 27 | | Department of Mathematics, University of Arizona, Tucson, AZ 85721 |
|
---|
| 28 | | |
|
---|
| 29 | | Everyone is permitted to copy, distribute and modify the code in this |
|
---|
| 30 | | directory, as long as this copyright note is preserved verbatim. |
|
---|
| 31 | *--------------------------------------------------------------------------*
|
---|
| 32 | |#
|
---|
| 33 |
|
---|
| 34 | (defpackage "TRIVIAL"
|
---|
| 35 | (:export trivial-p))
|
---|
| 36 | (in-package "TRIVIAL")
|
---|
| 37 |
|
---|
| 38 | ;; This package develops Kronecker-like algorithm to test
|
---|
| 39 | ;; that 1 is in the ideal <f1,f2,...,fn> where fi are polynomial expressions
|
---|
| 40 | ;; given in lisp (prefix notation)
|
---|
| 41 |
|
---|
| 42 | ;;Suppose we have a function f taking values f0, f1, ... , fn at
|
---|
| 43 | ;;points x0, x1, ... , xn and we want a function which will take a value
|
---|
| 44 | ;;f(n+1) at x(n+1); what is the formula?
|
---|
| 45 | ;;(x-x(n+1))*f(x)+f(n+1)
|
---|
| 46 |
|
---|
| 47 |
|
---|
| 48 |
|
---|
| 49 |
|
---|
| 50 |
|
---|
| 51 |
|
---|
| 52 | @
|
---|
Note:
See
TracBrowser
for help on using the repository browser.