On the complexity of skew arithmetic

DOI10.1007/S00200-015-0269-0MaRDI QIDQ260085zbMATH OpenOpenAlexFDO

Authors Joris van der Hoeven

Publication date 18 March 2016

Published in Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00200-015-0269-0

zbMATH Keywords

algorithmcomplexitydivisiongcrdlclmlinear differential operatorslocal solutionmultiplication

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Skew fields, division rings (12E15) Abstract differential equations (12H20)

Recommendations

• FFT-like multiplication of linear differential operators
• Fast algorithms for polynomial solutions of linear differential equations
• scientific article; zbMATH DE number 4155781
• On the differential and full algebraic complexities of operator matrices transformations
• Products of ordinary differential operators by evaluation and interpolation

Cites work

• scientific article; zbMATH DE number 6698765 (Why is no real title available?)
• scientific article; zbMATH DE number 1262439 (Why is no real title available?)
• scientific article; zbMATH DE number 2151191 (Why is no real title available?)
• scientific article; zbMATH DE number 2151193 (Why is no real title available?)
• An Algorithm for the Machine Calculation of Complex Fourier Series
• Complexity of factoring and calculating the GCD of linear ordinary differential operators
• Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten
• Differentiably finite power series
• Evaluating Polynomials at Fixed Sets of Points
• FFT-like multiplication of linear differential operators
• Factoring in skew-polynomial rings over finite fields
• Fast computation of common left multiples of linear ordinary differential operators
• Fast modular transforms
• Fast multiplication of large numbers
• Fast multiplication of polynomials over fields of characteristic 2
• Formale Theorie der linearen Differentialgleichungen. (Erster Teil).
• Gaussian elimination is not optimal
• How to multiply matrices faster
• Matrix multiplication via arithmetic progressions
• On fast multiplication of polynomials over arbitrary algebras
• On the complexity of skew arithmetic
• On the history of the theory of linear differential equations
• Polynomial evaluation and interpolation on special sets of points
• Powers of tensors and fast matrix multiplication
• Products of ordinary differential operators by evaluation and interpolation
• Relax, but don't be too lazy
• Theory of non-commutative polynomials

Cited in

(5)

• On the complexity of skew arithmetic
• Products of ordinary differential operators by evaluation and interpolation
• Constructive arithmetics in Ore localizations of domains
• Minimization of differential equations and algebraic values of 𝐸-functions
• Efficient Quotients of Non-commutative Polynomials

Describes a project that uses

Uses Software

• Mathemagix

This page was built for publication: On the complexity of skew arithmetic

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