A survey of techniques in applied computational complexity

DOI10.1016/0771-050X(75)90005-4MaRDI QIDQ1224857zbMATH OpenFDO

Authors Robert Meersman

Publication date 1975

Published in Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical computation of solutions to single equations (65H05) Algorithms in computer science (68W99)

Cites work

• scientific article; zbMATH DE number 3426876 (Why is no real title available?)
• scientific article; zbMATH DE number 3456435 (Why is no real title available?)
• scientific article; zbMATH DE number 3461412 (Why is no real title available?)
• scientific article; zbMATH DE number 3480093 (Why is no real title available?)
• scientific article; zbMATH DE number 3501005 (Why is no real title available?)
• scientific article; zbMATH DE number 1024452 (Why is no real title available?)
• scientific article; zbMATH DE number 3446409 (Why is no real title available?)
• scientific article; zbMATH DE number 3269388 (Why is no real title available?)
• scientific article; zbMATH DE number 3276110 (Why is no real title available?)
• scientific article; zbMATH DE number 3279592 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• scientific article; zbMATH DE number 3381785 (Why is no real title available?)
• scientific article; zbMATH DE number 3187178 (Why is no real title available?)
• scientific article; zbMATH DE number 3195683 (Why is no real title available?)
• A Family of Fourth Order Methods for Nonlinear Equations
• A bound on the multiplicative efficiency of iteration
• A fast method for interpolation using preconditioning
• A model for iterative computation
• A new upper bound on the complexity of derivative evaluation
• An Overview of the Theory of Computational Complexity
• An algorithm for division of powerseries
• Axioms and hulls
• Berechnung und Programm. I
• Berechnung und Programm. II
• Berechnungen in partiellen Algebren endlichen Typs
• Computational Complexity of Iterative Processes
• Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten
• Evaluation of rational functions
• Fast modular transforms
• Fast multiplication of large numbers
• Gaussian elimination is not optimal
• Maximal Stationary Iterative Methods for the Solution of Operator Equations
• On Minimizing the Number of Multiplications Necessary for Matrix Multiplication
• On computing reciprocals of power series
• On multiplication of 2 2 matrices
• On optimum root-finding algorithms
• On some topological properties of numerical algorithms
• On the Number of Multiplications for the Evaluation of a Polynomial and Some of Its Derivatives
• On the number of multiplications necessary to compute certain functions
• Optimal Order and Efficiency for Iterations with Two Evaluations
• Optimal Order of One-Point and Multipoint Iteration
• Optimal algorithms for parallel polynomial evaluation
• Parallel iteration methods
• Remarks on the complexity of roundoff analysis
• Simple proofs of lower bounds for polynomial evaluation
• Stability of Difference Equations and Convergence of Iterative Processes
• Sur le calcul des produits de matrices. (Calculation of the product of matrices.)
• The computational complexity of elliptic partial differential equations
• Toward Abstract Numerical Analysis

Cited in

(1)

• Dual problems of multiplication of a vector by a matrix

This page was built for publication: A survey of techniques in applied computational complexity

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