The polyadic structure of factorable function tensors with applications to high-order minimization techniques (Q1069447): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
Property / author | |||
Property / author: Richard H. F. Jackson / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Garth P. McCormick / rank | |||
Normal rank |
Revision as of 06:25, 10 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The polyadic structure of factorable function tensors with applications to high-order minimization techniques |
scientific article |
Statements
The polyadic structure of factorable function tensors with applications to high-order minimization techniques (English)
0 references
1986
0 references
Factorable functions are shown to have arrays of Nth-order derivatives (tensors) which are naturally computed as sums of generalized outer product matrices (polyads). The computational implications of this for high-order minimization techniques (such as Halley's method of tangent hyperbolas) are investigated. A direct derivation of these high-order techniques is also given.
0 references
factorable functions
0 references
nth-order derivatives
0 references
high-order minimization techniques
0 references
Halley's method
0 references
tangent hyperbolas
0 references