Trade‐off between information and computability: a technique for automated topological computations

DOI10.1108/03321640310474886MaRDI QIDQ4450412zbMATH OpenOpenAlexFDO

Authors S. Suuriniemi, L. Kettunen

Publication date 15 February 2004

Published in COMPEL: The International Journal for Computation and Mathematics in Electrical and Electronic Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1108/03321640310474886

zbMATH Keywords

finite element-based PDE solver software systems

Mathematics Subject Classification ID

Packaged methods for numerical algorithms (65Y15)

Recommendations

• Computable scalar fields: A basis for PDE software
• Automated Transformations for PDE Systems with Application to Multigrid Solvers
• Design and data structure of fully adaptive, multigrid, finite-element software
• Automated solution of differential equations by the finite element method. The FEniCS book
• scientific article; zbMATH DE number 1629973

Cites work

• On efficient sparse integer matrix Smith normal form computations

Cited in

(1)

• Difference forms

This page was built for publication: Trade‐off between information and computability: a technique for automated topological computations

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