On the complexities of the optimal rounding problems of sequences and matrices

DOI10.1007/3-540-44985-X_40MaRDI QIDQ2722004zbMATH OpenFDO

Authors Takeshi Tokuyama, Tetsuo Asano, Tomomi Matsui

Publication date 11 July 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44985-X_40

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Roundoff error (65G50) Complexity and performance of numerical algorithms (65Y20) Approximation algorithms (68W25)

Recommendations

• Optimal roundings of sequences and matrices
• Approximation and Online Algorithms
• Global roundings of sequences
• scientific article; zbMATH DE number 5006167
• Matrix rounding with low error in small submatrices

Cited in

(7)

• On complexity of round transformations
• The controlled rounding problem: Complexity and computational experience
• Combinatorics and algorithms for low-discrepancy roundings of a real sequence
• Optimal roundings of sequences and matrices
• scientific article; zbMATH DE number 5006167 (Why is no real title available?)
• Approximation and Online Algorithms
• Global roundings of sequences

This page was built for publication: On the complexities of the optimal rounding problems of sequences and matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2722004)