Matrices, continued fractions, and fast algorithms

DOI10.1515/RJNAMM.2010.031MaRDI QIDQ3060242zbMATH OpenOpenAlexFDO

Authors E. E. Tyrtyshnikov

Publication date 1 December 2010

Published in Russian Journal of Numerical Analysis and Mathematical Modelling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/rjnamm.2010.031

zbMATH Keywords

Euclidean algorithmHankel matriceslinear systems over finite fieldsmethod of leaps

Mathematics Subject Classification ID

Toeplitz, Cauchy, and related matrices (15B05) Matrices over special rings (quaternions, finite fields, etc.) (15B33) Direct numerical methods for linear systems and matrix inversion (65F05)

Recommendations

• Euclidean Algorithm and Hankel Matrices
• Matrix continued fractions
• Fast computation of continued fractions
• Continued fractions of matrices and expansions of special functions
• Continued fractions of matrices and expansions of some special functions

Cited in

(7)

• Solving Hankel systems over the integers
• A matrix interpretation of the extended Euclidean algorithm
• Structured matrices, continued fractions, and root localization of polynomials
• scientific article; zbMATH DE number 3883495 (Why is no real title available?)
• The Slow Continued Fraction Algorithm Via 2 × 2 Integer Matrices
• scientific article; zbMATH DE number 3627259 (Why is no real title available?)
• Algebraic reduction methods and their applications to matrix continued fractions

This page was built for publication: Matrices, continued fractions, and fast algorithms

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