Pages that link to "Item:Q1307245"
From MaRDI portal
The following pages link to Fast and parallel interval arithmetic (Q1307245):
Displaying 36 items.
- Multi-step root solvers of Traub's type in real interval arithmetic (Q298478) (← links)
- Computational complexity of iterated maps on the interval (Q449664) (← links)
- Fast interval matrix multiplication (Q451807) (← links)
- Solving a sparse system using linear algebra (Q491257) (← links)
- A blind digital image watermarking method based on the dyadic wavelet transform and interval arithmetic (Q505754) (← links)
- An algorithm for automatically selecting a suitable verification method for linear systems (Q633151) (← links)
- Verified bounds for singular values, in particular for the spectral norm of a matrix and its inverse (Q634116) (← links)
- Fast verified solutions of linear systems (Q849174) (← links)
- Interval Monte Carlo as an alternative to second-order sampling for estimating ecological risk (Q858156) (← links)
- Interval iterative methods for computing Moore-Penrose inverse (Q864808) (← links)
- Fast convolution and fast Fourier transform under interval and fuzzy uncertainty (Q1049276) (← links)
- Efficient approaches for enclosing the united solution set of the interval generalized Sylvester matrix equations (Q1690908) (← links)
- The Laurent-Horner method for validated evaluation of Chebyshev expansions (Q2184928) (← links)
- Modified error bounds for approximate solutions of dense linear systems (Q2293605) (← links)
- Iterative refinement for symmetric eigenvalue decomposition. II. Clustered eigenvalues (Q2318500) (← links)
- Fast algorithms for floating-point interval matrix multiplication (Q2428100) (← links)
- Fast inclusion of interval matrix multiplication (Q2484077) (← links)
- Complex interval arithmetic using polar form (Q2490456) (← links)
- Motivations for an arbitrary precision interval arithmetic and the MPFI library (Q2572919) (← links)
- Tight and efficient enclosure of matrix multiplication by using optimized BLAS. (Q2889382) (← links)
- An efficient approach to solve very large dense linear systems with verified computing on clusters (Q2948101) (← links)
- Solving Dense Interval Linear Systems with Verified Computing on Multicore Architectures (Q3081381) (← links)
- A blind digital image watermarking method based on the dyadic wavelet packet transform and fast interval arithmetic techniques (Q3451226) (← links)
- Interpolating Arithmetic Read-Once Formulas in Parallel (Q4388878) (← links)
- Computation of Algebraic Solutions to Interval Systems Via Systems of Coordinates (Q4577108) (← links)
- Simulation of a Controlled Aircraft Elevator under Sensor Uncertainties (Q4577120) (← links)
- On the algebraic Properties of Stochastic Arithmetic. Comparison to Interval Arithmetic (Q4577128) (← links)
- Mathematically rigorous global optimization in floating-point arithmetic (Q4685569) (← links)
- Piecewise linear secant approximation via algorithmic piecewise differentiation (Q4685600) (← links)
- Enclosing Chebyshev Expansions in Linear Time (Q4960945) (← links)
- Bounding error of calculating the matrix functions (Q5076644) (← links)
- Fast enclosing the solution set of the parametric Sylvester matrix equations (Q5084715) (← links)
- Computing Enclosures for the Matrix Exponential (Q5146627) (← links)
- How do you compute the midpoint of an interval? (Q5498687) (← links)
- The Lorenz system as a gradient-like system (Q6586970) (← links)
- An efficient approach for enclosing the solution set of the interval coupled Sylvester matrix equations (Q6617891) (← links)