Unrestricted Faithful Rounding is Good Enough for Some LNS Applications

Mark G. Arnold, Colin D. Walter

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Original language	Undefined/Unknown
Title of host publication	15th IEEE Symposium on Computer Arithmetic
Publisher	IEEE Computer Society Press
Pages	237-246
Number of pages	10
DOIs	https://doi.org/http://doi.ieeecomputersociety.org/10.1109/ARITH.2001.930125
Publication status	Published - 2001

Access to Document

@inproceedings{3099a7c763254ee0857dba53327cac8a,

title = "Unrestricted Faithful Rounding is Good Enough for Some LNS Applications",

author = "Arnold, {Mark G.} and Walter, {Colin D.}",

year = "2001",

doi = "http://doi.ieeecomputersociety.org/10.1109/ARITH.2001.930125",

language = "Undefined/Unknown",

pages = "237--246",

booktitle = "15th IEEE Symposium on Computer Arithmetic",

publisher = "IEEE Computer Society Press",

}

TY - GEN

T1 - Unrestricted Faithful Rounding is Good Enough for Some LNS Applications

AU - Arnold, Mark G.

AU - Walter, Colin D.

PY - 2001

Y1 - 2001

U2 - http://doi.ieeecomputersociety.org/10.1109/ARITH.2001.930125

DO - http://doi.ieeecomputersociety.org/10.1109/ARITH.2001.930125

M3 - Conference contribution

SP - 237

EP - 246

BT - 15th IEEE Symposium on Computer Arithmetic

PB - IEEE Computer Society Press

ER -