On the complexity of calculation of differentials and gradients

DOI10.1515/156939205774464936zbMath1082.65027OpenAlexW2002986730MaRDI QIDQ5704310

Sergey B. Gashkov, I. B. Gashkov

Publication date: 14 November 2005

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/156939205774464936

zbMATH Keywords

Taylor seriescomplexity of computationJacobian matricessecond differentialbilinear and quadratic formsHessian matrices polynomials

Mathematics Subject Classification ID

Numerical differentiation (65D25) Complexity and performance of numerical algorithms (65Y20)

Related Items (3)

Lower bounds for tropical circuits and dynamic programs ⋮ On the additive complexity of GCD and LCM matrices ⋮ Arithmetic complexity of certain linear transformations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the general Stokes formula
• Exponential polynomials
• Taylor expansion of the accumulated rounding error

This page was built for publication: On the complexity of calculation of differentials and gradients