An algorithm for computing the hull of the solution set of interval linear equations
β Scribed by Jiri Rohn
- Publisher
- Elsevier Science
- Year
- 2011
- Tongue
- English
- Weight
- 524 KB
- Volume
- 435
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A standard system of interval linear equations is defined by Ax = b, where A is an m x n coefficient matrix with (compact) intervals as entries, and b is an m-dimensional vector whose components are compact intervals. It is known that for systems of interval linear equations the solution set, i. e.,
We propose a method for computing the regular singular formal solutions of a linear differential system in the neighbourhood of a singular point. This algorithm avoids the use of cyclic vectors and has been implemented β in the computer algebra system Maple.
A method is described for solving a system of n linear equations in n unknowns when the coefficients and constants of the equations are specified as intervals. Here a solution is considered to be the supplying of optimal interval bounds for the unknowns. Even for small n, such systems of interval eq