Algorithm for computing Kronecker basis

DOI10.14495/JSIAML.1.60MaRDI QIDQ2858150zbMATH OpenOpenAlexFDO

Authors Yoshiaki Kakinuma, Kazuyuki Hiraoka, Hiroki Hashiguchi, Yutaka Kuwajima, Takaomi Shigehara

Publication date 19 November 2013

Published in JSIAM Letters (Search for Journal in Brave)

Full work available at URL https://www.jstage.jst.go.jp/A_PRedirectJournalInit?sryCd=jsiaml&kijiCd=1_0_60&screenID=AF06S010&noVol=1&noIssue=0

zbMATH Keywords

algorithmbackward stabilityKronecker basisKronecker canonical formmatrix pencilnumerical examplessingular value decompositions

Mathematics Subject Classification ID

Canonical forms, reductions, classification (15A21) Matrix pencils (15A22) Numerical solutions to overdetermined systems, pseudoinverses (65F20)

Recommendations

• Algorithm for computing Jordan basis
• Kronecker's algorithmic mathematics
• The complexity of computing Kronecker coefficients
• A variant of the Gröbner basis algorithm for computing Hilbert bases
• Computational algorithms based on the Schur representation
• Leverrier's algorithm for orthogonal polynomial bases
• A regular algorithm for finding the basis of the kernel of a linear operator
• An algorithm computing the general entry of the nth Kronecker power of a matrix
• On the complexity of computing Kronecker coefficients

This page was built for publication: Algorithm for computing Kronecker basis

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