目录

FAST_Poly

Overview

This section defines the data structure for a sparse-format polynomial. The polynomial is represented by a coefficient array coeff and an exponent array pow, and must be sorted in ascending order of exponents.

System capability: SystemCapability.FAST.Core

Since: 26.0.0

Related module: FAST

Header file: fast_solver_polynomial.h

Summary

[h2]Member Variables

Name Description
double * coeff Coefficient array of the polynomial.
uint32_t * pow Exponent array of the polynomial.
size_t length Number of terms in the polynomial.

Struct Member Variable Description

[h2]coeff

double * FAST_Poly::coeff

Description

Coefficient array of the polynomial, which corresponds one-to-one to the pow array and represents the coefficient value for each corresponding exponent term.

[h2]length

size_t FAST_Poly::length

Description

Number of terms in a polynomial, that is, the length of the coeff and pow arrays.

[h2]pow

uint32_t * FAST_Poly::pow

Description

Exponent array of a polynomial, which corresponds one-to-one to the coeff array and must be sorted in ascending order.