Numerical Computing with IEEE Floating Point Arithmetic
From MaRDI portal
Publication:2713714
DOI10.1137/1.9780898718072zbMath0981.68057OpenAlexW1533404702WikidataQ56018772 ScholiaQ56018772MaRDI QIDQ2713714
Publication date: 10 June 2001
Full work available at URL: https://doi.org/10.1137/1.9780898718072
Symbolic computation and algebraic computation (68W30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Software, source code, etc. for problems pertaining to computer science (68-04) Error analysis and interval analysis (65G99)
Related Items (39)
Pseudospectra of Loewner Matrix Pencils ⋮ Computation of the monodromy matrix in floating point arithmetic with the Wilkinson model ⋮ A framework for and empirical study of algorithms for traffic assignment ⋮ A note on the error analysis of classical Gram-Schmidt ⋮ The high relative accuracy of the HZ method ⋮ An algorithm for calculating logarithms through displacement ⋮ Computation of the largest positive Lyapunov exponent using rounding mode and recursive least square algorithm ⋮ Elastic-mode algorithms for mathematical programs with equilibrium constraints: global convergence and stationarity properties ⋮ Effective computational discretization scheme for nonlinear dynamical systems ⋮ Floating-point arithmetic ⋮ Universal MATLAB‐based square‐root solutions in the family of continuous‐discrete Gaussian filters for state estimation in nonlinear stochastic dynamic systems ⋮ Emergent scalar symmetry in discrete dynamical systems ⋮ On the Possibility of Increasing the Accuracy of Computations in the Floating-Point Format with Multiple Exponents ⋮ Regions of convergence and dynamics of Schröder-like iteration formulae as applied to complex polynomial equations with multiple roots ⋮ Solving time-dependent PDEs with the ultraspherical spectral method ⋮ FPGA acceleration of planar multibody dynamics simulations in the Hamiltonian-based divide-and-conquer framework ⋮ First-Order Perturbation Theory for Eigenvalues and Eigenvectors ⋮ Radial basis function approximation methods with extended precision floating point arithmetic ⋮ Safe and Verified Gomory Mixed-Integer Cuts in a Rational Mixed-Integer Program Framework ⋮ Cause and origin of Moire interferences in recursive processes and with fixed-point and floating-point data types ⋮ Numerical solution of linear eigenvalue problems ⋮ A local radial basis function method for advection-diffusion-reaction equations on complexly shaped domains ⋮ On the use of interval extensions to estimate the largest Lyapunov exponent from chaotic data ⋮ A meshless technique based on the radial basis functions for solving systems of partial differential equations ⋮ Radial basis functions method for solving the fractional diffusion equations ⋮ Precise numerical computation ⋮ On the global convergence of Schröder's iterative formulae for real roots of algebraic equations ⋮ Real-time arithmetic unit ⋮ Cholesky Factorisation of Linear Systems Coming from Finite Difference Approximations of Singularly Perturbed Problems ⋮ Transformation of a PID controller for numerical accuracy ⋮ Numerical stability of path-based algorithms for traffic assignment ⋮ Numerical approximations for the Riesz space fractional advection-dispersion equations via radial basis functions ⋮ Numerical methods for nonlinear equations ⋮ Detecting unreliable computer simulations of recursive functions with interval extensions ⋮ Estimating convergence regions of Schröder's iteration formula: how the Julia set shrinks to the Voronoi boundary ⋮ Unnamed Item ⋮ How Many Steps Still Left to $x$*? ⋮ Accuracy of one step of the Falk-Langemeyer method ⋮ Newton's Method in Mixed Precision
Uses Software
This page was built for publication: Numerical Computing with IEEE Floating Point Arithmetic
