Last change
on this file since 58 was 1, checked in by Marek Rychlik, 15 years ago |
First import of a version circa 1997.
|
File size:
1.0 KB
|
Line | |
---|
1 | #|
|
---|
2 | $Id: trivial.lisp,v 1.1 2009/01/19 08:51:43 marek Exp $
|
---|
3 | *--------------------------------------------------------------------------*
|
---|
4 | | Copyright (C) 1994, Marek Rychlik (e-mail: rychlik@math.arizona.edu) |
|
---|
5 | | Department of Mathematics, University of Arizona, Tucson, AZ 85721 |
|
---|
6 | | |
|
---|
7 | | Everyone is permitted to copy, distribute and modify the code in this |
|
---|
8 | | directory, as long as this copyright note is preserved verbatim. |
|
---|
9 | *--------------------------------------------------------------------------*
|
---|
10 | |#
|
---|
11 |
|
---|
12 | (defpackage "TRIVIAL"
|
---|
13 | (:export trivial-p))
|
---|
14 | (in-package "TRIVIAL")
|
---|
15 |
|
---|
16 | ;; This package develops Kronecker-like algorithm to test
|
---|
17 | ;; that 1 is in the ideal <f1,f2,...,fn> where fi are polynomial expressions
|
---|
18 | ;; given in lisp (prefix notation)
|
---|
19 |
|
---|
20 | ;;Suppose we have a function f taking values f0, f1, ... , fn at
|
---|
21 | ;;points x0, x1, ... , xn and we want a function which will take a value
|
---|
22 | ;;f(n+1) at x(n+1); what is the formula?
|
---|
23 | ;;(x-x(n+1))*f(x)+f(n+1)
|
---|
24 |
|
---|
25 |
|
---|
26 |
|
---|
27 |
|
---|
28 |
|
---|
29 |
|
---|
Note:
See
TracBrowser
for help on using the repository browser.