A new algorithm for Chebyshev minimum-error multiplication of reduced affine forms
From MaRDI portal
Publication:1689460
DOI10.1007/s11075-017-0300-6zbMath1415.65109OpenAlexW2593881468MaRDI QIDQ1689460
Publication date: 12 January 2018
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-017-0300-6
Related Items
A new method for computing a \(p\)-solution to parametric interval linear systems with affine-linear and nonlinear dependencies ⋮ Computing the spectral decomposition of interval matrices and a study on interval matrix powers ⋮ Linear interval parametric approach to testing pseudoconvexity ⋮ On preconditioning and solving an extended class of interval parametric linear systems
Cites Work
- Parameterized solution of linear interval parametric systems
- Linear systems with large uncertainties, with applications to truss structures
- Optimal value range in interval linear programming
- Comparison of interval methods for plotting algebraic curves
- Deterministic global optimization. Theory, methods and applications
- Affine arithmetic: concepts and applications
- An improved interval linearization for solving nonlinear problems
- Improved enclosure for some parametric solution sets with linear shape
- Enclosures for the solution set of parametric interval linear systems
- Generalization of a Parametric Fixed-Point Iteration
- Introduction to Interval Analysis
- Interval Methods for Systems of Equations
- Solvability of Parametric Interval Linear Systems of Equations and Inequalities
- Complete search in continuous global optimization and constraint satisfaction
- An Introduction to Affine Arithmetic
- Automatic computation of a linear interval enclosure
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
