what data structure for polinomial

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 ;


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
mlib_ImagePolynomialWarp(3MLIB) 			    mediaLib Library Functions				   mlib_ImagePolynomialWarp(3MLIB)

mlib_ImagePolynomialWarp - polynomial-based image warp SYNOPSIS
cc [ flag... ] file... -lmlib [ library... ] #include <mlib.h> mlib_status mlib_ImagePolynomialWarp(mlib_image *dst, const mlib_image *src, const mlib_d64 *xCoeffs, const mlib_d64 *yCoeffs, mlib_s32 n, mlib_d64 preShiftX, mlib_d64 preShiftY, mlib_d64 postShiftX, mlib_d64 postShiftY, mlib_d64 preScaleX, mlib_d64 preScaleY, mlib_d64 postScaleX, mlib_d64 postScaleY, mlib_filter filter, mlib_edge edge); DESCRIPTION
The mlib_ImagePolynomialWarp() function performs a polynomial-based image warp. The images must have the same type, and the same number of channels. The images can have 1, 2, 3, or 4 channels. The data type of the images can be MLIB_BYTE, MLIB_SHORT, MLIB_USHORT, or MLIB_INT. The source and destination images may have different sizes. The xCoeffs and yCoeffs parameters must contain the same number of coefficients of the form (n + 1)(n + 2)/2 for some n, where n is the degree power of the polynomial. The coefficients, in order, are associated with the terms: 1, x, y, x**2, x*y, y**2, ..., x**n, x**(n-1)*y, ..., x*y**(n-1), y**n and coefficients of value 0 cannot be omitted. The image pixels are assumed to be centered at .5 coordinate points. In other words, the upper-left corner pixel of an image is located at (0.5, 0.5). For each pixel in the destination image, its center point D is backward mapped to a point S in the source image. Then the source pixels with their centers surrounding point S are selected to do one of the interpolations specified by the filter parameter to generate the pixel value for point D. The mapping is defined by the two bivariate polynomial functions X(x, y) and Y(x, y) that map destination (x, y) coordinates to source X and Y positions respectively. The functions X(x, y) and Y(x, y) are: preX = (x + preShiftX)*preScaleX preY = (y + preShiftY)*preScaleY n i warpedX = SUM {SUM {xCoeffs_ij * preX**(i-j) * preY**j}} i=0 j=0 n i warpedY = SUM {SUM {yCoeffs_ij * preX**(i-j) * preY**j}} i=0 j=0 X(x, y) = warpedX*postScaleX - postShiftX Y(x, y) = warpedY*postScaleY - postShiftY The destination (x, y) coordinates are pre-shifted by (preShiftX, preShiftY) and pre-scaled by the factors preScaleX and preScaleY prior to the evaluation of the polynomial. The results of the polynomial evaluations are scaled by postScaleX and postScaleY, and then shifted by (-postShiftX, -postShiftY) to produce the source pixel coordinates. This process allows for better precision of the results and supports tiled images. PARAMETERS
The function takes the following arguments: dst Pointer to destination image. src Pointer to source image. xCoeffs Destination to source transform coefficients for the X coordinate. yCoeffs Destination to source transform coefficients for the Y coordinate. n Degree power of the polynomial. preShiftX Displacement to apply to destination X positions. preShiftY Displacement to apply to destination Y positions. postShiftX Displacement to apply to source X positions. postShiftY Displacement to apply to source Y positions. preScaleX Scale factor to apply to destination X positions. preScaleY Scale factor to apply to destination Y positions. postScaleX Scale factor to apply to source X positions. postScaleY Scale factor to apply to source Y positions. filter Type of resampling filter. It can be one of the following: MLIB_NEAREST MLIB_BILINEAR MLIB_BICUBIC MLIB_BICUBIC2 edge Type of edge condition. It can be one of the following: MLIB_EDGE_DST_NO_WRITE MLIB_EDGE_SRC_PADDED RETURN VALUES
The function returns MLIB_SUCCESS if successful. Otherwise it returns MLIB_FAILURE. ATTRIBUTES
See attributes(5) for descriptions of the following attributes: +-----------------------------+-----------------------------+ | ATTRIBUTE TYPE | ATTRIBUTE VALUE | +-----------------------------+-----------------------------+ |Interface Stability |Committed | +-----------------------------+-----------------------------+ |MT-Level |MT-Safe | +-----------------------------+-----------------------------+ SEE ALSO
mlib_ImagePolynomialWarp_Fp(3MLIB), mlib_ImagePolynomialWarpTable(3MLIB), mlib_ImagePolynomialWarpTable_Fp(3MLIB), attributes(5) SunOS 5.11 2 Mar 2007 mlib_ImagePolynomialWarp(3MLIB)