Polynomial pattern finding in scattered data (Q507857)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6682619
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial pattern finding in scattered data |
scientific article; zbMATH DE number 6682619 |
Statements
Polynomial pattern finding in scattered data (English)
0 references
9 February 2017
0 references
The problem of the determination of polynomial patterns in scattered data appears in different branches of science and engineering. The applications of reliable software tools that detect in a curve or surface a determined polynomial pattern are many. A new technique is used here, which is rotted in the great potential of applications linked to orthogonal polynomials. The new numerical procedure for the calculation of the MOSFET threshold voltage is introduced using the properties of discrete orthogonal Chebyshev polynomials.
0 references
MOSFET threshold voltage
0 references
polynomial pattern
0 references
Chebyshev polynomials
0 references
semiconductors
0 references
0 references
0.662820041179657
0 references
0.6537680625915527
0 references
0.6503786444664001
0 references
0.6466583609580994
0 references
