Results 1  10
of
705,794
Interval Linear Constraint Solving Using the Preconditioned Interval GaussSeidel Method
 IN PROCEEDINGS OF THE TWELFTH INTERNATIONAL CONFERENCE ON LOGIC PROGRAMMING, LOGIC PROGRAMMING
, 1994
"... We propose the use of the preconditioned interval GaussSeidel method as the backbone of an efficient linear equality solver in a CLP(Interval) language. The method, as originally designed, works only on linear systems with square coefficient matrices. Even imposing such a restriction, a naive incor ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
We propose the use of the preconditioned interval GaussSeidel method as the backbone of an efficient linear equality solver in a CLP(Interval) language. The method, as originally designed, works only on linear systems with square coefficient matrices. Even imposing such a restriction, a naive
A Review of Preconditioners for the Interval GaussSeidel Method
, 1991
"... . Interval Newton methods in conjunction with generalized bisection can form the basis of algorithms that find all real roots within a specified box X ae R n of a system of nonlinear equations F (X) = 0 with mathematical certainty, even in finiteprecision arithmetic. In such methods, the system ..."
Abstract

Cited by 58 (18 self)
 Add to MetaCart
F (X) = 0 is transformed into a linear interval system 0 = F (M) +F 0 (X)( ~ X \Gamma M); if interval arithmetic is then used to bound the solutions of this system, the resulting box ~ X contains all roots of the nonlinear system. We may use the interval GaussSeidel method to find these solution
Optimal Preconditioners for Interval GaussSeidel Methods
"... this paper, we will concentrate on optimal preconditioners, computed rowbyrow, only. A preconditioned interval GaussSeidel method may be used to compute a new interval ~ x k for the kth variable. Suppose Y k = (y k1 ..."
Abstract
 Add to MetaCart
this paper, we will concentrate on optimal preconditioners, computed rowbyrow, only. A preconditioned interval GaussSeidel method may be used to compute a new interval ~ x k for the kth variable. Suppose Y k = (y k1
(1.1) æ A Review of Preconditioners for the Interval Gauss–Seidel Method
"... Abstract. Interval Newton methods in conjunction with generalized bisection can form the basis of algorithms that find all real roots within a specified box X ⊂ R n of a system of nonlinear equations F(X) = 0 with mathematical certainty, even in finiteprecision arithmetic. In such methods, the sys ..."
Abstract
 Add to MetaCart
, the system F (X) = 0 is transformed into a linear interval system 0 = F (M) + F ′ (X) ( ˜ X − M); if interval arithmetic is then used to bound the solutions of this system, the resulting box ˜ X contains all roots of the nonlinear system. We may use the interval Gauss–Seidel method to find these solution
Parallel multigrid smoothing: polynomial versus GaussSeidel
 J. Comp. Phys
, 2003
"... Abstract. GaussSeidel method is often the smoother of choice within multigrid applications. In the context of unstructured meshes, however, maintaining good parallel efficiency is difficult with multiplicative iterative methods such as GaussSeidel. This leads us to consider alternative smoothers. ..."
Abstract

Cited by 46 (13 self)
 Add to MetaCart
Abstract. GaussSeidel method is often the smoother of choice within multigrid applications. In the context of unstructured meshes, however, maintaining good parallel efficiency is difficult with multiplicative iterative methods such as GaussSeidel. This leads us to consider alternative smoothers
An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
, 2008
"... ..."
Asymptotic Confidence Intervals for Indirect Effects in Structural EQUATION MODELS
 IN SOCIOLOGICAL METHODOLOGY
, 1982
"... ..."
Interval Linear Constraint Solving in Constraint Logic Programming
, 1994
"... Existing interval constraint logic programming languages, such as BNR Prolog, work under the framework of interval narrowing and are deficient in solving general systems of constraints over real, which constitute an important class of problems in engineering and other applications. In this thesis, w ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
, we suggest to separate linear constraint solving from nonlinear constraint solving. Two implementations of an efficient interval linear equality constraint solver, which are based on generalized interval Gaussian elimination and the incremental preconditioned interval GaussSeidel method
Theory and Practice of Constraint Handling Rules
, 1998
"... Constraint Handling Rules (CHR) are our proposal to allow more flexibility and applicationoriented customization of constraint systems. CHR are a declarative language extension especially designed for writing userdefined constraints. CHR are essentially a committedchoice language consisting of mu ..."
Abstract

Cited by 459 (36 self)
 Add to MetaCart
of multiheaded guarded rules that rewrite constraints into simpler ones until they are solved. In this broad survey we aim at covering all aspects of CHR as they currently present themselves. Going from theory to practice, we will define syntax and semantics for CHR, introduce an important decidable
Results 1  10
of
705,794