scientific article; zbMATH DE number 1746043
From MaRDI portal
Publication:4531992
zbMath0985.65523MaRDI QIDQ4531992
Publication date: 27 May 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2064/20640222
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
limitsinterval arithmeticC++random access machinesmulti-valued functionsmultiple precision arithmeticcomputable real analysis
Related Items
Abstract State Machines with Exact Real Arithmetic ⋮ Exact real computation of solution operators for linear analytic systems of partial differential equations ⋮ Towards Using Exact Real Arithmetic for Initial Value Problems ⋮ Axiomatic reals and certified efficient exact real computation ⋮ The ksmt calculus is a \(\delta \)-complete decision procedure for non-linear constraints ⋮ Infinite-precision inner product and sparse matrix-vector multiplication using Ozaki scheme with Dot2 on manycore processors ⋮ Time Complexity and Convergence Analysis of Domain Theoretic Picard Method ⋮ Learning figures with the Hausdorff metric by fractals -- towards computable binary classification ⋮ Limit cycles and their period detection via numeric and symbolic hybrid computations ⋮ Computational complexity of iterated maps on the interval ⋮ Quantitative continuity and Computable Analysis in Coq ⋮ Leading Digits of Mersenne Numbers ⋮ Real Numbers and BDDs ⋮ Implementing Real Numbers With RZ ⋮ The world's shortest correct exact real arithmetic program? ⋮ The constructive reals as a Java library ⋮ Arbitrary precision real arithmetic: design and algorithms ⋮ Efficient exact computation of iterated maps ⋮ Parametrised second-order complexity theory with applications to the study of interval computation ⋮ Improving Floating-Point Numbers: A Lazy Approach to Adaptive Accuracy Refinement for Numerical Computations ⋮ The \texttt{ksmt} calculus is a \(\delta \)-complete decision procedure for non-linear constraints ⋮ On the Kolmogorov Complexity of Continuous Real Functions ⋮ A constructive theory of continuous domains suitable for implementation ⋮ On the computability of the set of automorphisms of the unit square ⋮ Motivations for an arbitrary precision interval arithmetic and the MPFI library ⋮ Computational complexity of classical solutions of partial differential equations ⋮ Admissibly Represented Spaces and Qcb-Spaces
Uses Software
This page was built for publication:
