## Figures from this paper

## 9 Citations

Fast algorithms for elementary operations on complex power series

- Mathematics
- 2010

Abstract It is shown that the inversion of a complex-valued power series can be realised asymptotically with complexity of 5/4 multiplications (if we compare the upper bounds). It is shown that the…

Homotopy techniques for multiplication modulo triangular sets

- Mathematics, Computer ScienceJ. Symb. Comput.
- 2011

Homotopy techniques for multiplication modulo triangular sets ( Spine

- Computer Science, Mathematics
- 2009

This thesis obtains a quasi-linear time complexity for substantial families of examples, for which no such result was known before, and proposes an algorithm that relies on homotopy and fast evaluation-interpolation techniques.

Solving composite sum of powers via Padé approximation and orthogonal polynomials with application to optimal PWM problem

- Mathematics, Computer ScienceAppl. Math. Comput.
- 2014

Complete Fast Analytical Solution of the Optimal Odd Single-Phase Multilevel Problem

- Computer Science, MathematicsIEEE Transactions on Industrial Electronics
- 2010

A new general modulation strategy for ML inverters is introduced, which takes an analytic form and is very fast, with a complexity of only O(n log2 n) arithmetic operations, where n is the number of controlled harmonics.

Counting Matrices that are Squares

- Mathematics
- 2016

On the math-fun mailing list (7 May 2013), Neil Sloane asked to calculate the number of $n \times n$ matrices with entries in $\{0,1\}$ which are squares of other such matrices. In this paper we…

Single-phase optimal Odd PWM problem

- Computer Science2008 34th Annual Conference of IEEE Industrial Electronics
- 2008

An exact and fast algorithm with the complexity of only O(n log2 n) arithmetic operations is introduced for computation of optimal switching angles of a odd PWM waveform for generating general odd symmetric waveforms.

## References

SHOWING 1-10 OF 14 REFERENCES

The truncated fourier transform and applications

- Mathematics, Computer ScienceISSAC '04
- 2004

A truncated version of the classical Fast Fourier Transform that has the nice property of eliminating the "jumps" in the complexity at powers of two and gains a logarithmic factor with respect to the best previously known algorithms.

Fast Algorithms for Manipulating Formal Power Series

- MathematicsJACM
- 1978

This paper shows that the composition and reversion problems are equivalent (up to constant factors), and gives algorithms which require only order (n log n) ~/2 operations in many cases of practical importance.

Multiple-precision zero-finding methods and the complexity of elementary function evaluation

- Mathematics, Computer ScienceArXiv
- 2010

Modern computer algebra

- Computer ScienceSIGA
- 2002

This highly successful textbook, widely regarded as the “bible of computer algebra”, gives a thorough introduction to the algorithmic basis of the mathematical engine in computer algebra systems.

Modern Computer Algebra

- Computer Science
- 1998

This highly successful textbook, widely regarded as the 'bible of computer algebra', gives a thorough introduction to the algorithmic basis of the mathematical engine in computer algebra systems.

Relax, but Don't be Too Lazy

- Computer ScienceJ. Symb. Comput.
- 2002

This paper surveys several classical and new zealous algorithms for manipulating formal power series, including algorithms for multiplication, division, resolution of differential equations, composition and reversion, and gives various relaxed algorithms for these operations.

Removing redundancy in high-precision

- Newton iteration,
- 2004

REMOVING REDUNDANCY IN HIGH-PRECISION NEWTON ITERATION

- Mathematics
- 2004

This paper presents new algorithms for several high-precision operations in the power series ring C[[x]]. Compared to computing n coefficients of a product in C[[x]], computing n coefficients of a…