Formal derivation of algorithms

DOI10.1145/779359.779365zbMath1072.65064OpenAlexW2044997049WikidataQ113309748 ScholiaQ113309748MaRDI QIDQ5461057

Enrique S. Quintana-Ortí, Robert A. van de Geijn

Publication date: 21 July 2005

Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/779359.779365

zbMATH Keywords

performancealgorithmstriangular Sylvester equation

Mathematics Subject Classification ID

Matrix equations and identities (15A24) Complexity and performance of numerical algorithms (65Y20)

Related Items (6)

Computational Methods for Linear Matrix Equations ⋮ Recursive blocked algorithms for linear systems with Kronecker product structure ⋮ Deriving dense linear algebra libraries ⋮ An iterative method to compute the sign function of a non-Hermitian matrix and its application to the overlap Dirac operator at nonzero chemical potential ⋮ Mathematics turned inside out: the intensive faculty versus the extensive faculty ⋮ RECSY and SCASY Library Software: Recursive Blocked and Parallel Algorithms for Sylvester-Type Matrix Equations with Some Applications

Uses Software

• ATLAS
• LAPACK
• BLAS
• mctoolbox
• PHiPAC
• Control System Toolbox

This page was built for publication: Formal derivation of algorithms