Fast method to compute the scalar product of gradient and given vector (Q1116641): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Herbert Fischer / rank
Normal rank
 
Property / author
 
Property / author: Herbert Fischer / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Pascal-SC / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic differentiation: techniques and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Differentiation in PASCAL-SC: type GRADIENT / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:26, 19 June 2024

scientific article
Language Label Description Also known as
English
Fast method to compute the scalar product of gradient and given vector
scientific article

    Statements

    Fast method to compute the scalar product of gradient and given vector (English)
    0 references
    0 references
    1989
    0 references
    The paper gives a new method for computing \(g(u)^ t\cdot v\), where g is the gradient of a rational function of n variables f and v is a given vector. It is shown that the amount of work needed for computing the scalar product grows as the number of operations to evaluate f(x), while the standard method for the scalar product computation needs an amount of work which grows as the product of the number of operations to evaluate f(x) and the number of variables, i.e. the dimension of vector x.
    0 references
    rational function
    0 references
    gradient
    0 references
    scalar product
    0 references
    complexity
    0 references
    automatic differentiation
    0 references
    0 references

    Identifiers