Cited in
(38)- Fast enclosure for solutions of generalized Sylvester equations
- Enclosing Moore-Penrose inverses
- Computing enclosures for the matrix Mittag-Leffler function
- Computing the spectral decomposition of interval matrices and a study on interval matrix powers
- A general method for enclosing solutions of interval linear equations
- Verified error bounds for solutions of Sylvester matrix equations
- Weak and strong solvability of interval linear systems of equations and inequalities
- On unique solvability of the absolute value equation
- An algorithm for computing the hull of the solution set of interval linear equations
- Efficient approaches for enclosing the united solution set of the interval generalized Sylvester matrix equations
- Computing enclosures for the matrix exponential
- Fast verified computation for the solution of the T-congruence Sylvester equation
- Verified computation for the matrix Lambert \(W\) function
- Advanced interval tools for computing solutions of continuous games
- ADHC
- Verified computation for the matrix principal logarithm
- Verified bounds for all the singular values of matrix
- Verified computation of the matrix exponential
- b4m
- INTLAB
- CTDSX
- ParLinSys
- AggDef2
- VERPINV
- NACLab
- CTLEX
- Verified computation of real powers of matrices
- mincx.m
- Verification of linear (in)dependence in finite precision arithmetic
- Accurate solution of dense linear systems. II: Algorithms using directed rounding
- On the possibilistic approach to linear regression models involving uncertain, indeterminate or interval data
- Componentwise enclosure for solutions of least squares problems and underdetermined systems
- Fast enclosure for solutions in underdetermined systems
- On Relation Between P-Matrices and Regularity of Interval Matrices
- Verified computation of matrix gamma function
- Fast enclosure for the minimum norm least squares solution of the matrix equation AXB = C
- Fast enclosure for solutions of Sylvester equations
- Enclosing the solution set of the parametric generalised Sylvester matrix equation \(A(p) XB (p) + C(p) XD (p) = F(p)\)
This page was built for software: VERSOFT
