C-XSC. A programming environment for verified scientific computing and numerical data processing. C-XSC is a tool for the development of numerical algorithms delivering highly accurate and automatically verified results. It provides a large number of predefined numerical data types and operators. These types are implemented as C++ classes. Thus, C-XSC allows high-level programming of numerical applications in C and C++. The C-XSC package is available for all computers with a C++ compiler translating the AT&T language standard 2.0.

References in zbMATH (referenced in 85 articles , 1 standard article )

Showing results 1 to 20 of 85.
Sorted by year (citations)

1 2 3 4 5 next

  1. Haro, Àlex; Canadell, Marta; Figueras, Jordi-Lluís; Luque, Alejandro; Mondelo, Josep-Maria: The parameterization method for invariant manifolds. From rigorous results to effective computations (2016)
  2. Kolberg, Mariana; Bohlender, Gerd; Fernandes, Luiz Gustavo: An efficient approach to solve very large dense linear systems with verified computing on clusters. (2015)
  3. Arrondo, A.G.; Fernández, J.; Redondo, J.L.; Ortigosa, P.M.: An approach for solving competitive location problems with variable demand using multicore systems (2014)
  4. Frommer, Andreas; Hashemi, Behnam; Sablik, Thomas: Computing enclosures for the inverse square root and the sign function of a matrix (2014)
  5. Rauh, Andreas; Senkel, Luise; Auer, Ekaterina; Aschemann, Harald: Interval methods for real-time capable robust control of solid oxide fuel cell systems (2014)
  6. Senkel, Luise; Rauh, Andreas; Aschemann, Harald: Sliding mode techniques for robust trajectory tracking as well as state and parameter estimation (2014)
  7. Hölbig, Carlos A.; Do Carmo, Andriele; Arendt, Luis P.: High accuracy and interval arithmetic on multicore processors (2013)
  8. Krämer, Walter: High performance verified computing using C-XSC (2013)
  9. Zimmer, Michael; Rebner, Gabor; Krämer, Walter: An overview of C-XSC as a tool for interval arithmetic and its application in computing verified uncertain probabilistic models under Dempster-Shafer theory (2013)
  10. Dyllong, Eva; Kiel, Stefan: A comparison of verified distance computation between implicit objects using different arithmetics for range enclosure (2012)
  11. Frommer, Andreas; Hashemi, Behnam: Verified error bounds for solutions of Sylvester matrix equations (2012)
  12. Krämer, Walter: Multiple/arbitrary precision interval computations in C-XSC (2012)
  13. Nehmeier, Marco: Interval arithmetic using expression templates, template meta programming and the upcoming C++ standard (2012)
  14. Rump, Siegfried M.: Fast interval matrix multiplication (2012)
  15. Zimmer, Michael; Krämer, Walter; Popova, Evgenija D.: Solvers for the verified solution of parametric linear systems (2012)
  16. Chen, Chin-Yun: Extended interval Newton method based on the precise quotient set (2011)
  17. Chen, Xiaojun; Frommer, Andreas; Lang, Bruno: Computational existence proofs for spherical $t$-designs (2011)
  18. Johnson, Tomas; Tucker, Warwick: A note on the convergence of parametrised non-resonant invariant manifolds (2011)
  19. Johnson, Tomas; Tucker, Warwick: On a computer-aided approach to the computation of Abelian integrals (2011)
  20. Popova, Evgenija; Krämer, Walter: Embedding C-XSC nonlinear solvers in Mathematica (2011)

1 2 3 4 5 next