AbstractThis note is about a methodology utilizing inexact computation in conjunction with exact computation where the exact input is known and exact output is desired. The inexact computation is used to help avert the growth of intermediate expressions. This growth frequently makes using exact computation infeasible. We mention several existing applications and also mention where the methodology is not useful. We propose new directions where one can make effective use of the stabilization methodology
It is commonly realized that informal reasoning about distributed algorithms in general and self-sta...
LU and Cholesky matrix factorization algorithms are core subroutines used to solve systems of linear...
In this paper, the conception of numerical stabilization, which is related to mantissa digits of com...
AbstractThis note is about a methodology utilizing inexact computation in conjunction with exact com...
We propose a method to automatically convert unstable programs in symbolic computationinto stable pr...
AbstractWe propose a new method for converting a Gröbner basis w.r.t. one term order into a Gröbner ...
Stabilization procedures are critical feature to accelerate the convergence of column generation alg...
The common goal of self-validating methods and computer algebra methods is to solve mathematical pro...
Abs6~1c-A new promlure for s t a b i i an unstable system by stable feedback is presented. The proce...
AbstractAlgebraic models of real computation and their induced notions of time complexity neglect st...
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Compute...
In our recent work on iterative computation in hardware, we showed that arbitrary-precision solvers ...
AbstractStatic analysis by abstract interpretation aims at automatically proving properties of compu...
Finite precision computations affect the accuracy of computed solutions and sometimes the stability ...
The terms stability and conditioning are used with a variety of meanings in Numerical Analysis. All ...
It is commonly realized that informal reasoning about distributed algorithms in general and self-sta...
LU and Cholesky matrix factorization algorithms are core subroutines used to solve systems of linear...
In this paper, the conception of numerical stabilization, which is related to mantissa digits of com...
AbstractThis note is about a methodology utilizing inexact computation in conjunction with exact com...
We propose a method to automatically convert unstable programs in symbolic computationinto stable pr...
AbstractWe propose a new method for converting a Gröbner basis w.r.t. one term order into a Gröbner ...
Stabilization procedures are critical feature to accelerate the convergence of column generation alg...
The common goal of self-validating methods and computer algebra methods is to solve mathematical pro...
Abs6~1c-A new promlure for s t a b i i an unstable system by stable feedback is presented. The proce...
AbstractAlgebraic models of real computation and their induced notions of time complexity neglect st...
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Compute...
In our recent work on iterative computation in hardware, we showed that arbitrary-precision solvers ...
AbstractStatic analysis by abstract interpretation aims at automatically proving properties of compu...
Finite precision computations affect the accuracy of computed solutions and sometimes the stability ...
The terms stability and conditioning are used with a variety of meanings in Numerical Analysis. All ...
It is commonly realized that informal reasoning about distributed algorithms in general and self-sta...
LU and Cholesky matrix factorization algorithms are core subroutines used to solve systems of linear...
In this paper, the conception of numerical stabilization, which is related to mantissa digits of com...