Formal derivation of algorithms
From MaRDI portal
Recommendations
- An algorithmic approach to simultaneous triangularization
- Solving triangular algebraic systems by means of simultaneous iterations
- The Sylvester equation and approximate balanced reduction
- A formal method for developing algebraic and numerical algorithms
- Algorithms for computing triangular decomposition of polynomial systems
- scientific article; zbMATH DE number 7108676
- Formalization and execution of linear algebra: from theorems to algorithms
- An algorithm computing the regular formal solutions to a system of linear differential equations
- Algorithms for computing triangular decompositions of polynomial systems
Cited in
(9)- RECSY and SCASY Library Software: Recursive Blocked and Parallel Algorithms for Sylvester-Type Matrix Equations with Some Applications
- Recursive blocked algorithms for linear systems with Kronecker product structure
- Look left, look right, look left again: An application of fractal symbolic analysis to linear algebra code restructuring
- scientific article; zbMATH DE number 7266604 (Why is no real title available?)
- Deriving dense linear algebra libraries
- The science of deriving dense linear algebra algorithms
- Computational Methods for Linear Matrix Equations
- 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
This page was built for publication: Formal derivation of algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5461057)
