Numerical Software with Result Verification
From MaRDI portal
Publication:5308342
DOI10.1007/b96498zbMath1126.65328OpenAlexW203078251MaRDI QIDQ5308342
Werner Hofschuster, Walter Krämer
Publication date: 28 September 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b96498
Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Packaged methods for numerical algorithms (65Y15)
Related Items (24)
Transport Phenomena in Viscoplastic Materials ⋮ The transmission process: a combinatorial stochastic process for the evolution of transmission trees over networks ⋮ Inner and outer bounds for the solution set of parametric linear systems ⋮ High performance verified computing using C-XSC ⋮ High accuracy and interval arithmetic on multicore processors ⋮ Global dynamic optimization using edge-concave underestimator ⋮ Multiple/arbitrary precision interval computations in C-XSC ⋮ Solvers for the verified solution of parametric linear systems ⋮ A comparison of verified distance computation between implicit objects using different arithmetics for range enclosure ⋮ Testing interval arithmetic libraries, including their IEEE-1788 compliance ⋮ A rigorous deterministic global optimization approach for the derivation of secondary information in digital maps ⋮ Remarks on geometric properties of SQG sharp fronts and \(\alpha\)-patches ⋮ Global Smooth Solutions for the Inviscid SQG Equation ⋮ Computing Enclosures for the Matrix Exponential ⋮ Multi-dimensional pruning from the Baumann point in an interval global optimization algorithm ⋮ Inconsistencies in Numerical Simulations of Dynamical Systems Using Interval Arithmetic ⋮ Computing enclosures for the inverse square root and the sign function of a matrix ⋮ On Newman polynomials which divide no Littlewood polynomial ⋮ Improved interval methods for solving circle packing problems in the unit square ⋮ C-XSC ⋮ C-XSC 2.0 ⋮ Computer-assisted proofs in PDE: a survey ⋮ Optimal centers in branch-and-prune algorithms for univariate global optimization ⋮ Efficient task scheduling in the parallel result-verifying solution of nonlinear systems
Uses Software
This page was built for publication: Numerical Software with Result Verification
