scientific article; zbMATH DE number 917814

zbMATH Open0859.65042MaRDI QIDQ4888611

Ion Păvăloiu

Publication date: 15 April 1997

Title of this publication is not available (Why is that?)

zbMATH Keywords

computational complexityefficiencyiterative methodsnonlinear equationpolynomial interpolations

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05) Complexity and performance of numerical algorithms (65Y20)

Related Items (2)

Lower complexity bounds for interpolation algorithms ⋮ Title not available (Why is that?)

Recommendations

• The complexity of evaluating interpolation polynomials 👍 👎
• On the computational complexity of integral equations 👍 👎
• Lower complexity bounds for interpolation algorithms 👍 👎
• Optimization-based computation of analytic interpolants of bounded complexity 👍 👎
• On the efficiency of the computations for approximating the solutions of equations 👍 👎
• Computational complexity of spline interpolation 👍 👎
• Computational Aspects of Polynomial Interpolation in Several Variables 👍 👎
• Computational Complexity of Sparse Rational Interpolation 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4888611)