๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The solution of linear interval equations by a linear programming method

โœ Scribed by Oliver Aberth

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
556 KB
Volume
259
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

โœฆ Synopsis

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 equations can be difficult to solve, requiring extensive computation. The method described is a generalization of a linear programming method proposed long ago by W. Oettli, and leads to a relatively simple solution algorithm applicable to systems of small size.

๐Ÿ“œ SIMILAR VOLUMES

The solution of sparse linear equations
The solution of sparse linear equations by the conjugate gradient method
โœ A. Jennings; G. M. Malik ๐Ÿ“‚ Article ๐Ÿ“… 1978 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 930 KB

## Abstract The convergence properties of the conjugate gradient method are discussed in relation to relaxation methods and Chebyshev accelerated Jacobi iteration when applied to the solution of large sets of linear equations which have a sparse, symmetric and positive definite coefficient matrix.

Solution of Linear Differential Equation
Solution of Linear Differential Equations by the Method of Divided Differences
โœ L. Verdestar ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 615 KB

We introduce a new method for the solution of linear differential equations with constant coefficients. The solutions are obtained by the application of a divided differences functional to a kernel function in two variables. For homogeneous equations the kernel is the product of a polynomial, which