Login or Register to Ask a Question and Join Our Community


Programming

what data structure for polinomial

Login to Discuss or Reply to this Discussion in Our Community

 
Thread Tools Search this Thread
Top Forums Programming what data structure for polinomial
# 1  
Old 10-07-2002
Question what data structure for polynomial
Hello, guys

Anyone had experiences to express polynomial using c language. I want to output the polynomial formula after I solve the question. Not to count the value of a polynomial.

That means I have to output the polynomial formula to screen.

such as:
f := p^100-4275+56*p^57+123*(1-p)^34 ;

362880*p^45-14515200*p^44+282592800*p^43-3567715200*p^42+32833495800*p^41-234748765440*p^40+1357020856800*p^39-6517548349200*p^38+26521978127400*p^37-92792729053500*p^36+282287441908080*p^35-753273866698920*p^34+1775448575926410*p^33-3716558335019880*p^32+6939551178972720*p^31-11596879696617600*p^30+17388982649046960*p^29-23437879996999860*p^28+28429756177413360*p^27-31050312703343640*p^26+30532209914200806*p^25-27011077082801580*p^24+21469710851551800*p^23-15300758477189520*p^22+9748958193896580*p^21-5532426738592740*p^20+2782630494934920*p^19-1232671556293800*p^18+477077447178540*p^17-159642667620135*p^16+45558310696800*p^15-10884316965480*p^14+2121183237600*p^13-324496267200*p^12+36628300800*p^11-2719892160*p^10+100000000*p^9;

This can be done beatifully by Maple.But I do not know how they do this.

Last edited by xli3; 11-01-2002 at 09:48 PM..
Login or Register to Ask a Question

Previous Thread | Next Thread

10 More Discussions You Might Find Interesting

1. Shell Programming and Scripting

Help with reformat data structure

Input file: bv|111259484|pir||T49736_real_data bv|159484|pir||T9736_data_figure bv|113584|prf|T4736|truth bv|113584|pir||T4736_truth Desired output: bv|111259484|pir|T49736|real_data bv|159484|pir|T9736|data_figure bv|113584|prf|T4736|truth bv|113584|pir|T4736|truth Once the... (8 Replies)
Discussion started by: perl_beginner
8 Replies

2. Shell Programming and Scripting

Do you recognize this data structure?

I am working with an undocumented feature of a software product (BladeLogic). It is returning the below string in response to a query. It is enclosed with square brackets, "records" are separated with commas and "fields" separated with semicolons. My thought was that this might be some basic... (1 Reply)
Discussion started by: dshcs
1 Replies

3. Programming

The World's Most Advanced Lexicon-Data-Structure

Hello, Over the past few years, I've conducted some rather thorough R&D in the field of lexicon-data-structure optimization. A Trie is a good place to start, followed by a traditional DAWG. Smaller means faster, but a traditional DAWG encoding operates as a Boolean-graph, unable to index... (1 Reply)
Discussion started by: HeavyJ
1 Replies

4. Shell Programming and Scripting

perl data structure

Hi All, I want to create a data structure like this $VAR1 = { 'testsuite' => { 'DHCP' => { 'failures' => '0', 'errors' => '0', 'time' =>... (3 Replies)
Discussion started by: Damon_Qu
3 Replies

5. Shell Programming and Scripting

Perl Data Structure - Non unique values

I have the perl data structure and what i need to do is find all values in @{$extractColumns{'2'}{'D'}} which are not there in @{$extractColumns{'2'}{'M'}} but seems like i need to put a flag somewhere and i messed up foreach my $order (keys %extractColumns) { foreach my $value... (2 Replies)
Discussion started by: dinjo_jo
2 Replies

6. Programming

Using General Data Structure Library (GDSL)

Dear All, I would appreciate if some one could please post a few examples using GDSL library. The library provides general data structure operations. I am having confusion using list data structure regarding arguments. Would appreciate your kind response. with regards, Usman (2 Replies)
Discussion started by: usman_minhas
2 Replies

7. Programming

how to get the process data structure through pid?

hello guys, i'm required to modify the process scheduling part of the freebsd kernel as part of our homework. the homework needs us add a new variable to the process data structure, and the priority of the process will be having something to do with the variable. to adjust the variable... (2 Replies)
Discussion started by: billconan
2 Replies

8. Shell Programming and Scripting

tree structure of the data

Hello, I have a file of the following information ( first field parent item, second field child item) PM01 PM02 PM01 PM1A PM02 PM03 PM03 PM04 PM03 PM05 PM03 PM06 PM05 PM10 PM1A PM2A PM2A PM3B PM2A PM3C The output should be like this : PM01 PM02 PM03 PM04 ... (2 Replies)
Discussion started by: ThobiasVakayil
2 Replies

9. Programming

How to implement an on-disk data structure

I have heard about on-disk data structures, but I am trying to understand how to implement it. I want to write a program which is going to make use of a B-Tree which is so huge that whole of it cannot sit in memory. Lets take a simple case of a linked list. Suppose I want to have a linked... (1 Reply)
Discussion started by: the_learner
1 Replies

10. Filesystems, Disks and Memory

inode data structure

the superblock has the offset for inode table. My question is 1) whether it starts relative to the start of the first cylinder group or is it relative to the start of filesystem??? 2)and also which entry corresponds to the root(/) inode?? is it second or third entry??? My questions are... (4 Replies)
Discussion started by: anwerreyaz
4 Replies
Login or Register to Ask a Question

LEARN ABOUT DEBIAN

basis

basis(7rheolef) 						    rheolef-6.1 						   basis(7rheolef)

NAME

       basis - polynomial basis

SYNOPSYS

       The basis class defines functions that evaluates a polynomial basis and its derivatives on a point. The polynomial basis is designated by a
       string, e.g. "P0", "P1", "P2", "bubble",...  indicating the basis. The basis depends also  of  the  reference  element:	triangle,  square,
       tetrahedron (see reference_element(2)).	For instance, on a square, the "P1" string designates the common Q1 four-nodes basis on the refer-
       ence square.

       The nodes associated to the Lagrange polynomial basis are also available by its associated accessor.

IMPLEMENTATION NOTE

       The basis class is a see smart_pointer(2)) class on a basis_rep class that is a pure virtual base class for effective bases, e.g. basis_P1,
       basis_P1, etc.

IMPLEMENTATION

       template<class T>
       class basis_basic : public smart_pointer<basis_rep<T> > {
       public:

       // typedefs:

	   typedef basis_rep<T> 			  rep;
	   typedef smart_pointer<rep>			  base;
	   typedef typename basis_rep<T>::size_type	  size_type;

       // allocators:

	   basis_basic (std::string name = "");

       // accessors:

	   std::string name() const;
	   size_type   degree() const;
	   size_type   size (reference_element hat_K) const;

	   void hat_node(
	       reference_element	      hat_K,
	       std::vector<point_basic<T> >&  hat_node) const;

	   void eval(
	       reference_element    hat_K,
	       const point_basic<T>&	     hat_x,
	       std::vector<T>&	values) const;

	   void grad_eval(
	       reference_element    hat_K,
	       const point_basic<T>&	     hat_x,
	       std::vector<point_basic<T> >&  values) const;
       };
       typedef basis_basic<Float> basis;

SEE ALSO

       reference_element(2), smart_pointer(2)

rheolef-6.1							    rheolef-6.1 						   basis(7rheolef)