Study of linear information for classes of polynomial equations
From MaRDI portal
Recommendations
- On polynomial solutions of linear differential equations
- scientific article; zbMATH DE number 3965312
- scientific article; zbMATH DE number 3916753
- On solutions of linear equations with polynomial coefficients
- On linear equations with general polynomial solutions
- On linear equations with polynomial coefficients
- Publication:4204502
- scientific article; zbMATH DE number 4019481
- On polynomial rings in information dynamics of linear CA
- On Polynomial Rings in Information Dynamics of Linear CA
Cites work
- scientific article; zbMATH DE number 3840541 (Why is no real title available?)
- Any iteration for polynomial equations using linear information has infinite complexity
- Bisection is optimal
- For which error criteria can we solve nonlinear equations?
- Global Convergence of a Modified Newton Iteration for Algebraic Equations
- On the Optimal Solution of Large Linear Systems
- On the cost of approximating all roots of a complex polynomial
- On the cost of computing roots of polynomials
- The fundamental theorem of algebra and complexity theory
Cited in
(6)- Exhaustive use of information on an equation with truncated coefficients
- Asymptotic near optimality of the bisection method
- Average errors for zero finding: Lower bounds for smooth or monotone functions
- Optimal solution of nonlinear equations
- On polynomial rings in information dynamics of linear CA
- On Polynomial Rings in Information Dynamics of Linear CA
This page was built for publication: Study of linear information for classes of polynomial equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1123546)
