Symbolic Analysis of Computational Algorithms with SYDNA

Radu Zapotinschi
Additional contact information
Radu Zapotinschi: “Babeş-Bolyai” University, Department of Applied Mathematics

A chapter in Computer Algebra in Scientific Computing CASC’99, 1999, pp 499-509 from Springer

Abstract: Abstract The paper presents SYDNA (SYmbolic-Driven Numerical Analysis), a computer algebra library dedicated to the analysis and synthesis of numerical algorithms. The system provides a framework for expressing different parts of complex problem solving procedures. Numerical algorithms are specified using a higher- order functor system, which maximizes code reusability. Efficient implementations are generated by fully instantiating the functors at compile-time, optimizing specifications through program transformations and code generation.

Keywords: Code Generation; Computer Algebra; Discretization Method; Computer Algebra System; Program Transformation (search for similar items in EconPapers)
Date: 1999
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-60218-4_38

Ordering information: This item can be ordered from
http://www.springer.com/9783642602184

DOI: 10.1007/978-3-642-60218-4_38

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().