Name
Abstract | ||
|---|---|---|
The Moore test is a powerful tool for finding all solutions of nonlinear equations. However, this algorithm requires tremendously many interval computations and iterative bisections of regions. This paper describes that Gray code is an effective code for the Moore test. Using the property of the MSB (most significant bit) first algorithm of the Gray code arithmetic, we can perform the Moore test with the least required accuracy, i.e., the least computational cost. Further, we point out that the region bisection corresponds to the MSB first computation by the Gray code arithmetic. Using this fact, we show that the computational results before the bisection are reused for the bisected regions and that the computational cost is considerably reduced. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1109/ISCAS.2005.1465209 | ISCAS (3) |
Keywords | Field | DocType |
Gray codes,computational complexity,digital arithmetic,iterative methods,nonlinear equations,Gray code arithmetic,MSB first algorithm,Moore test,computational cost,iterative bisections,most significant bit,nonlinear equations,region bisection | Most significant bit,Nonlinear system,Iterative method,Computer science,System testing,Binary code,Algorithm,Gray code,Computational complexity theory,Computation | Conference |
ISSN | ISBN | Citations |
0271-4302 | 0-7803-8834-8 | 0 |
PageRank | References | Authors |
0.34 | 1 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Takashi Hisakado | 1 | 8 | 4.87 |
| Kohshi Okumura | 2 | 16 | 5.43 |