scientific article; zbMATH DE number 1746051
From MaRDI portal
Publication:4532000
Recommendations
Cited in
(13)- Bit-complexity of solving systems of linear evolutionary partial differential equations
- Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations
- Real computation with least discrete advice: a complexity theory of nonuniform computability
- Computing Solutions of Symmetric Hyperbolic Systems of PDE's
- Uniformly computable aspects of inner functions
- Computability of the Spectrum of Self-Adjoint Operators and the Computable Operational Calculus
- Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs with guaranteed precision
- Spectral decomposition and eigenvectors of matrices by residue calculus
- Primitive recursive ordered fields and some applications
- Another look at the eigenvalues of functions of a pair of orthogonal projectors
- Computability in linear algebra
- Stability versus speed in a computable algebraic model
- Primitive recursive ordered fields and some applications
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4532000)