The following pages link to J. F. Traub (Q751813):
Displaying 50 items.
- Information-based complexity: New questions for mathematicians (Q751814) (← links)
- Average case optimality for linear problems (Q796299) (← links)
- Optimal radius of convergence of interpolatory iterations for operator equations (Q1146501) (← links)
- Convergence and complexity of interpolatory-Newton iteration in a Banach space (Q1146502) (← links)
- Complexity of linear programming (Q1165154) (← links)
- Measures of uncertainty and information in computation (Q1194255) (← links)
- Selection of good algorithms from a family of algorithms for polynomial derivative evaluation (Q1248372) (← links)
- Linear ill-posed problems are solvable on the average for all Gaussian measures (Q1345067) (← links)
- Qubit complexity of continuous problems (Q2431383) (← links)
- A three-stage variable-shift iteration for polynomial zeros and its relation to generalized Rayleigh iteration (Q2533492) (← links)
- The shifted QR algorithm for Hermitian matrices (Q2545456) (← links)
- An analysis of the shifted LR algorithm (Q2556197) (← links)
- (Q3038616) (← links)
- (Q3142556) (← links)
- (Q3206311) (← links)
- On the Number of Multiplications for the Evaluation of a Polynomial and Some of Its Derivatives (Q3214408) (← links)
- Variational Calculations of the<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:mn>2</mml:mn><mml:mi /><mml:mrow><mml:mmultiscripts><mml:mrow><mml:mi>S</mml:mi></mml:mrow><mml:mprescripts /><mml:mrow /><mml:mrow><mml:mn>3</mm (Q3255289) (← links)
- Comments on a recent paper0 (Q3276888) (← links)
- Comparison of iterative methods for the calculation of <i>n</i> th roots (Q3277669) (← links)
- On a class of iteration formulas and some historical notes (Q3287507) (← links)
- (Q3637028) (← links)
- A brief history of information-based complexity (Q3656491) (← links)
- (Q3673103) (← links)
- (Q3738558) (← links)
- On the Optimal Solution of Large Linear Systems (Q3765108) (← links)
- On the nth Derivative of the Inverse Function (Q3848294) (← links)
- (Q3883494) (← links)
- On the Complexity of Composition and Generalized Composition of Power Series (Q3893296) (← links)
- (Q3925805) (← links)
- The Monte Carlo Algorithm with a Pseudorandom Generator (Q3987938) (← links)
- Perspectives on information-based complexity (Q3992024) (← links)
- (Q3993216) (← links)
- (Q3993279) (← links)
- (Q4040428) (← links)
- (Q4042615) (← links)
- (Q4050143) (← links)
- Principles for Testing Polynomial Zerofinding Programs (Q4069694) (← links)
- (Q4082295) (← links)
- Optimal Order and Efficiency for Iterations with Two Evaluations (Q4096337) (← links)
- Accelerated Iterative Methods for the Solution of Tridiagonal Systems on Parallel Computers (Q4117306) (← links)
- Asymptotic Behavior of Vector Recurrences with Applications (Q4122723) (← links)
- (Q4127276) (← links)
- The Algebraic Theory of Matrix Polynomials (Q4134093) (← links)
- All Algebraic Functions Can Be Computed Fast (Q4147592) (← links)
- Algorithms for Solvents of Matrix Polynomials (Q4167476) (← links)
- (Q4183874) (← links)
- Convergence and Complexity of Newton Iteration for Operator Equations (Q4188656) (← links)
- (Q4226567) (← links)
- (Q4279725) (← links)
- (Q4770479) (← links)
