An algebraic method for computing N^(f)
From MaRDI portal
Recommendations
- On the Computation of An
- An algorithm of computing \(b\)-functions
- scientific article; zbMATH DE number 1380820
- An algebraic approach to the vector \(\varepsilon\)-algorithm
- The epsilon algorithm in a noncommutative algebra
- Algebraic methods to compute Mathieu functions
- An algorithm for computing an integral basis in an algebraic function field
- Newton's method and the computational complexity of the fundamental theorem of algebra
- scientific article; zbMATH DE number 1273654
- On the approximation to algebraic numbers by algebraic numbers
Cites work
- scientific article; zbMATH DE number 1382087 (Why is no real title available?)
- scientific article; zbMATH DE number 49719 (Why is no real title available?)
- scientific article; zbMATH DE number 3413541 (Why is no real title available?)
- Coincidence Nielsen numbers for covering maps for smooth manifolds
- Epsilon Nielsen fixed point theory
- Lectures on Nielsen fixed point theory
- Nielsen number of a covering map
Cited in
(6)- Why does the FN-method work?
- The covering coincidence index and the covering Nielsen number
- An algorithm to prove algebraic relations involving eta quotients
- scientific article; zbMATH DE number 4017268 (Why is no real title available?)
- scientific article; zbMATH DE number 1305471 (Why is no real title available?)
- Epsilon Nielsen coincidence theory
This page was built for publication: An algebraic method for computing \(N^\epsilon(f)\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q386170)