D.M. Gay. Solving interval linear equations. SIAM Journal on Numerical Analysis, 19(4):858--870, 1982. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Efficient Interval Linear Equality Solving in Constraint Logic.. - Chiu, Lee (1 citation) (Correct)
....decomposition procedure is shown in algorithm 4. To improve the efficiency of linear constraint solving, we pass the linear constraint T 0 = P j k=1 (s k Theta T k ) to the non linear solver instead of the linear solver. Interval linear constraint solving usually involves variable elimination [20, 23, 43], which is a time consuming process. If we deliver the constraint T 0 = P j k=1 (s k Theta T k ) to the linear solver, the temporary variables T k , for k = 1; 2; j, are unique there and they can never be eliminated. Thus, such a delivery does not help to give sharper results, but only ....
D.M. Gay. Solving interval linear equations. SIAM Journal on Numerical Analysis, 19(4):858--870, 1982.
Interval Linear Constraint Solving in Constraint Logic Programming - Chiu (1994) (Correct)
....procedure is shown in algorithm 4.1. To improve the efficiency of linear constraint solving, we pass the linear constraint T 0 = P j k=1 (s k Theta T k ) to the non linear solver instead of the linear solver. Interval linear constraint solving usually involves variable elimination [20, 25, 48], which is a time consuming symbolic algorithm. If we deliver the constraint T 0 = P j k=1 (s k Theta T k ) to the linear solver, the temporary variables T k , for k = 1; 2; j, are unique there and they can never be eliminated. Thus, such a delivery does not help to give sharper ....
D.M. Gay. Solving interval linear equations. SIAM Journal on Numerical Analysis, 19(4):858--870, 1982.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC