scientific article; zbMATH DE number 3682951
algorithmsbounds for the solutionconvex programming problemseigenproblemserror estimatesfloating-pointfloating-point algorithmsFortran-programsGauss-, Jacobi- and Crout-Doolittle-algorithmsHilbert matrixinterval arithmeticlarge sparse linear and non- linear systemslinear systemsroots of a polynomialrounded arithmetic
Software, source code, etc. for problems pertaining to numerical analysis (65-04) Direct numerical methods for linear systems and matrix inversion (65F05) Iterative numerical methods for linear systems (65F10) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical computation of matrix norms, conditioning, scaling (65F35) Interval and finite arithmetic (65G30) Numerical computation of solutions to single equations (65H05) Numerical computation of solutions to systems of equations (65H10) Numerical mathematical programming methods (65K05) Convex programming (90C25)
- E-methods for fixed point equations f(x)=x
- Die Auflösbarkeit linearer Kreisscheiben- und Intervall-Gleichungssysteme
- Solving nonlinear systems with least significant bit accuracy
- Estimation of the sensitivity of linear and nonlinear algebraic problems
- On the solution of interval linear systems
- On proving existence of feasible points in equality constrained optimization problems
- Precise numerical computation
- Highly accurate verified error bounds for Krylov type linear system solvers
- 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
- Improved iteration schemes for validation algorithms for dense and sparse nonlinear systems
- Epsilon-inflation with contractive interval functions
- Rigorous verification of feasibility
- 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
- A Taylor model toolbox for solving ODEs implemented in Matlab/INTLAB
- Towards optimal use of multi-precision arithmetic: a remark
- Verified numerical computations for large-scale linear systems.
- Floating-point arithmetic on the test bench. How are verified numerical solutions calculated?
- Solvers for the verified solution of parametric linear systems
- Fast interval matrix multiplication
- A heuristic verification of the degree of the approximate GCD of two univariate polynomials
- Mathematically rigorous global optimization in floating-point arithmetic
- Rigorous solution of linear programming problems with uncertain data
- Verified Error Bounds for All Eigenvalues and Eigenvectors of a Matrix
- Computing enclosures for the matrix exponential
- Computational error bounds for multiple or nearly multiple eigenvalues
- The exact dot product as basic tool for long interval arithmetic
- Very fast and exact accumulation of products
- Verified error bounds for solutions of Sylvester matrix equations
- Interval algorithm for absolute value equations
- Verified error bounds for eigenvalues of geometric multiplicity \(q\) and corresponding invariant subspaces
- Verified error bounds for singular solutions of nonlinear systems
- An interval algorithm for solving systems of linear equations to prespecified accuracy
- Interval linear systems with symmetric matrices, skew-symmetric matrices and dependencies in the right hand side
- On the fast solution of Toeplitz-block linear systems arising in multivariate approximation theory
- Super-fast validated solution of linear systems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3878653)
