scientific article

Publication date: 1980

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

algorithms linear systems error estimates interval arithmetic Hilbert matrix eigenproblems floating-point roots of a polynomial bounds for the solution rounded arithmetic convex programming problems floating-point algorithms Fortran-programs Gauss-, Jacobi- and Crout-Doolittle-algorithms large sparse linear and non- linear systems

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical mathematical programming methods (65K05) Convex programming (90C25) Numerical computation of solutions to systems of equations (65H10) Interval and finite arithmetic (65G30) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Numerical computation of solutions to single equations (65H05) Direct numerical methods for linear systems and matrix inversion (65F05) Software, source code, etc. for problems pertaining to numerical analysis (65-04)

Related Items

Highly accurate verified error bounds for Krylov type linear system solvers ⋮ Verified Error Bounds for All Eigenvalues and Eigenvectors of a Matrix ⋮ Experiences with a method for enclosing solutions of systems of equations ⋮ Epsilon-inflation in verification algorithms ⋮ Verified solution of large systems and global optimization problems ⋮ Floating-point arithmetic on the test bench. How are verified numerical solutions calculated? ⋮ On the fast solution of Toeplitz-block linear systems arising in multivariate approximation theory ⋮ Super-fast validated solution of linear systems ⋮ Improved iteration schemes for validation algorithms for dense and sparse nonlinear systems ⋮ Verified numerical computations for large-scale linear systems. ⋮ Solvers for the verified solution of parametric linear systems ⋮ E-methods for fixed point equations f(x)=x ⋮ The exact dot product as basic tool for long interval arithmetic ⋮ Very fast and exact accumulation of products ⋮ Die Auflösbarkeit linearer Kreisscheiben- und Intervall-Gleichungssysteme ⋮ Fast interval matrix multiplication ⋮ Solving nonlinear systems with least significant bit accuracy ⋮ Verified error bounds for solutions of Sylvester matrix equations ⋮ A heuristic verification of the degree of the approximate GCD of two univariate polynomials ⋮ Interval algorithm for absolute value equations ⋮ Estimation of the sensitivity of linear and nonlinear algebraic problems ⋮ Computing Enclosures for the Matrix Exponential ⋮ On the solution of interval linear systems ⋮ Epsilon-inflation with contractive interval functions ⋮ Verified error bounds for eigenvalues of geometric multiplicity \(q\) and corresponding invariant subspaces ⋮ Computing enclosures for the inverse square root and the sign function of a matrix ⋮ Improved componentwise verified error bounds for least squares problems and underdetermined linear systems ⋮ Computational error bounds for multiple or nearly multiple eigenvalues ⋮ Rigorous verification of feasibility ⋮ Precise numerical computation ⋮ Towards optimal use of multi-precision arithmetic: a remark ⋮ Mathematically rigorous global optimization in floating-point arithmetic ⋮ A Taylor model toolbox for solving ODEs implemented in Matlab/INTLAB ⋮ Verified error bounds for singular solutions of nonlinear systems ⋮ Rigorous solution of linear programming problems with uncertain data ⋮ An interval algorithm for solving systems of linear equations to prespecified accuracy ⋮ On proving existence of feasible points in equality constrained optimization problems ⋮ Interval linear systems with symmetric matrices, skew-symmetric matrices and dependencies in the right hand side